Vehicle routing problem for multi-product cross-docking

Cross-docking is a logistic technique that can reduce costs occurred in a supply chain network while increasing the flow of goods, thus shortening the shipping cycle. Inside a cross-dock facility, the goods are directly transferred from incoming vehicles to outgoing vehicles without storing them in-...

Full description

Saved in:
Bibliographic Details
Main Authors: GUNAWAN, Aldy, WIDJAJA, Audrey Tedja, GAN, Benjamin, YU, Vincent F., JODIAWAN, Panca
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2020
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/5258
https://ink.library.smu.edu.sg/context/sis_research/article/6261/viewcontent/98_AbstractPaperFile_1011101615.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-6261
record_format dspace
spelling sg-smu-ink.sis_research-62612020-07-30T06:59:54Z Vehicle routing problem for multi-product cross-docking GUNAWAN, Aldy WIDJAJA, Audrey Tedja GAN, Benjamin YU, Vincent F. JODIAWAN, Panca Cross-docking is a logistic technique that can reduce costs occurred in a supply chain network while increasing the flow of goods, thus shortening the shipping cycle. Inside a cross-dock facility, the goods are directly transferred from incoming vehicles to outgoing vehicles without storing them in-between. Our research extends and combines this cross-docking technique with a well-known logistic problem, the vehicle routing problem (VRP), for delivering multiple products and addresses it as the VRP for multi-product cross-docking (VRP-MPCD). We developed a mixed integer programming model and generated two sets of VRP-MPCD instances, which are based on VRPCD instances. The instances are solved by a commercial software AMPL with CPLEX solver. The findings show that the small instances can be solved optimally by CPLEX. However, larger instances cannot be solved optimally within predefined computational times. 2020-03-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/5258 https://ink.library.smu.edu.sg/context/sis_research/article/6261/viewcontent/98_AbstractPaperFile_1011101615.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Vehicle routing problem Cross-docking Multiple products Mathematical programming model Computer Sciences Operations and Supply Chain Management Operations Research, Systems Engineering and Industrial Engineering
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Vehicle routing problem
Cross-docking
Multiple products
Mathematical programming model
Computer Sciences
Operations and Supply Chain Management
Operations Research, Systems Engineering and Industrial Engineering
spellingShingle Vehicle routing problem
Cross-docking
Multiple products
Mathematical programming model
Computer Sciences
Operations and Supply Chain Management
Operations Research, Systems Engineering and Industrial Engineering
GUNAWAN, Aldy
WIDJAJA, Audrey Tedja
GAN, Benjamin
YU, Vincent F.
JODIAWAN, Panca
Vehicle routing problem for multi-product cross-docking
description Cross-docking is a logistic technique that can reduce costs occurred in a supply chain network while increasing the flow of goods, thus shortening the shipping cycle. Inside a cross-dock facility, the goods are directly transferred from incoming vehicles to outgoing vehicles without storing them in-between. Our research extends and combines this cross-docking technique with a well-known logistic problem, the vehicle routing problem (VRP), for delivering multiple products and addresses it as the VRP for multi-product cross-docking (VRP-MPCD). We developed a mixed integer programming model and generated two sets of VRP-MPCD instances, which are based on VRPCD instances. The instances are solved by a commercial software AMPL with CPLEX solver. The findings show that the small instances can be solved optimally by CPLEX. However, larger instances cannot be solved optimally within predefined computational times.
format text
author GUNAWAN, Aldy
WIDJAJA, Audrey Tedja
GAN, Benjamin
YU, Vincent F.
JODIAWAN, Panca
author_facet GUNAWAN, Aldy
WIDJAJA, Audrey Tedja
GAN, Benjamin
YU, Vincent F.
JODIAWAN, Panca
author_sort GUNAWAN, Aldy
title Vehicle routing problem for multi-product cross-docking
title_short Vehicle routing problem for multi-product cross-docking
title_full Vehicle routing problem for multi-product cross-docking
title_fullStr Vehicle routing problem for multi-product cross-docking
title_full_unstemmed Vehicle routing problem for multi-product cross-docking
title_sort vehicle routing problem for multi-product cross-docking
publisher Institutional Knowledge at Singapore Management University
publishDate 2020
url https://ink.library.smu.edu.sg/sis_research/5258
https://ink.library.smu.edu.sg/context/sis_research/article/6261/viewcontent/98_AbstractPaperFile_1011101615.pdf
_version_ 1770575351833952256