A matheuristic algorithm for the vehicle routing problem with cross-docking
This paper studies the integration of the vehicle routing problem with cross-docking (VRPCD). The aim is to find a set of routes to deliver products from a set of suppliers to a set of customers through a cross-dock facility, such that the operational and transportation costs are minimized, without...
Saved in:
Main Authors: | GUNAWAN, Aldy, WIDJAJA, Audrey Tedja, VANSTEENWEGEN, Pieter, YU, Vincent F. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/6039 https://ink.library.smu.edu.sg/context/sis_research/article/7042/viewcontent/Matheuristics_algorithm_2021_av_ASC.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A matheuristic algorithm for solving the vehicle routing problem with cross-docking
by: GUNAWAN, Aldy, et al.
Published: (2020) -
Two-phase matheuristic for the vehicle routing problem with reverse cross-docking
by: GUNAWAN, Aldy, et al.
Published: (2022) -
Vehicle routing problem with reverse cross-docking: An adaptive large neighborhood search algorithm
by: GUNAWAN, Aldy, et al.
Published: (2020) -
Adaptive large neighborhood search for vehicle routing problem with cross-docking
by: GUNAWAN, Aldy, et al.
Published: (2020) -
Integrated assignment and routing with mixed service mode cross-dock
by: YU, Vincent, et al.
Published: (2019)