Harmony search algorithm for time-dependent vehicle routing problem with time windows

• Main Authors: LIANG, Yun-Chia, MINANDA, Vanny, GUNAWAN, Aldy, CHEN, Angela Hsiang-Ling
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2019
• Subjects: vehicle routing problem; time-dependent; time windows; harmony search algorithm; combinatorial optimization problem; Artificial Intelligence and Robotics; Theory and Algorithms
• Online Access: https://ink.library.smu.edu.sg/sis_research/4830; https://ink.library.smu.edu.sg/context/sis_research/article/5833/viewcontent/Collective_Outsourcing_COM_pv.pdf
• Institution: Singapore Management University

Vehicle Routing Problem (VRP) is a combinatorial problem where a certain set of nodes must be visited within a certain amount of time as well as the vehicle’s capacity. There are numerous variants of VRP such as VRP with time windows, where each node has opening and closing time, therefore, the visi...