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

• المؤلفون الرئيسيون: HANDOKO, Stephanus Daniel, GUPTA, Abhishek, HENG, Chen Kim, LAU, Hoong Chuin, ONG, Yew Soon, TAN, Puay Siew
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2015
• الموضوعات: 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
• الوصول للمادة أونلاين: 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

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...