Harmony search algorithm for time-dependent vehicle routing problem with time windows
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...
Saved in:
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: | |
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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Metaheuristics for time-dependent vehicle routing problem with time windows
by: LIANG, Yun-C, et al.
Published: (2022) -
Application of an improved harmony search algorithm on electric vehicle routing problems
by: MINANDA, Vanny, et al.
Published: (2024) -
Vehicle routing problem with time windows and a limited number of vehicles
by: Lau, H.C., et al.
Published: (2013) -
Heuristic methods for vehicle routing problem with time windows
by: Tan, K.C., et al.
Published: (2013) -
Hybrid genetic algorithms in solving vehicle routing problems with time window constraints
by: Tan, K.C., et al.
Published: (2014)