Solving multi-vehicle profitable tour problem via knowledge adoption in evolutionary bi-level programming

Solving multi-vehicle profitable tour problem via knowledge adoption in evolutionary bi-level programming

Profitable tour problem (PTP) belongs to the class of vehicle routing problem (VRP) with profits seeking to maximize the difference between the total collected profit and the total cost incurred. Traditionally, PTP involves single vehicle. In this paper, we consider PTP with multiple vehicles. Unlik...

Full description

Saved in:
Bibliographic Details
Main Authors: HANDOKO, Stephanus Daniel, GUPTA, Abhishek, HENG, Chen Kim, LAU, Hoong Chuin, ONG, Yew Soon, TAN, Puay Siew
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2015
Subjects:
Bi-level programming
Customer selections
Evolutionary method
Multiple knapsack problem
Optimization problems
Urban consolidation
Vehicle routing problem
Winner determination problem
Computer Sciences
Operations Research, Systems Engineering and Industrial Engineering
Transportation
Online Access:https://ink.library.smu.edu.sg/sis_research/3373
https://ink.library.smu.edu.sg/context/sis_research/article/4375/viewcontent/CEC_2015_Solving_Multi_vehicle_Profitable_Tour_Problem.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/3373
https://ink.library.smu.edu.sg/context/sis_research/article/4375/viewcontent/CEC_2015_Solving_Multi_vehicle_Profitable_Tour_Problem.pdf

Similar Items