A matheuristic algorithm for the vehicle routing problem with cross-docking

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

Full description

Saved in:
Bibliographic Details
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:
Adaptive large neighborhood search
Cross-docking
Matheuristic
Scheduling
Set-partitioning formulation
Vehicle routing problem
Artificial Intelligence and Robotics
Operations Research, Systems Engineering and Industrial Engineering
Theory and Algorithms
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

Internet

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

Similar Items