The vehicle routing problem with multiple prioritized time windows: A case study |
| |
| Affiliation: | 1. School of Math and Computer, Wuhan Polytechnic University, Wuhan 430023, Hubei, China;2. Department of Economics and Management, Wuhan Polytechnic University, Wuhan 430023, Hubei, China;3. Key Laboratory of Image Information Processing and Intelligent Control, School of Automation, Huazhong University of Science and Technology, Wuhan 430074, Hubei, China;1. Logistics Research Center, Shanghai Maritime University, Shanghai 200135, China;2. The Antai College of Economics & Management, Shanghai Jiao Tong University, Shanghai 200052, China;1. CONACYT – CIMAT, A.C. Bartolomé de las Casas 314, Barrio la Estación, 20259 Aguascalientes, Ags, Mexico;2. CIMAT, A.C. Jalisco s/n, Valenciana, 36240 Guanajuato, Gto, Mexico;1. School of Economics and Management, Beijing Jiaotong University, Room 718, Si Yuan Dong Lou, No. 3 Shang Yuan Cun, Hai Dian District, Beijing 100044, China;2. Environmental and Ecological Engineering, Purdue University, Potter Engineering Center, Room 364, 500 Central Drive, West Lafayette, IN 47907, United States;3. School of Mechanical Engineering, Purdue University, ME 2194, 585 Purdue Mall, West Lafayette, IN 47907, United States;1. Department of Logistics Engineering, Universitas Pertamina, Indonesia;2. Department of Industrial Management, National Taiwan University of Science and Technology, Taiwan;3. Fresh & Fast Cold Chain Technology Incorporated, Taiwan |
| |
| Abstract: | This paper addresses Multi-objective Vehicle Routing Problem with Multiple Prioritized Time Windows (VRPMPTW) in which the distributer proposes a set of all non-overlapping time windows with equal or different lengths and the customers prioritize these delivery time windows. VRPMPTW aims to find a set of routes of minimal total traveling cost and maximal customer satisfaction (with regard to the prioritized time windows), starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. This problem is inspired from a real life application. The contribution of this paper lies in its addressing the VRPMPTW from a problem definition, modeling and methodological point of view. We developed a mathematical model for this problem. This model can simply be used for a wide range of applications where the customers have multiple flexible time windows and violation of time windows may drop the satisfaction levels of customers and lead to profit loss in the long term. A Cooperative Coevolutionary Multi-objective Quantum-Genetic Algorithm (CCMQGA) is also proposed to solve this problem. A new local search is designed and used in CCMQGA to reach an appropriate pareto front. Finally, the proposed approach is employed in a real case study and the results of the proposed CCMQGA are compared with the current solution obtained from managerial experience, the results of NSGA-II and the multi-objective quantum-inspired evolutionary algorithm. |
| |
| Keywords: | Multi-objective optimization Vehicle routing problem with multiple prioritized time windows Cooperative coevolutionary multi-objective quantum-genetic algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
