An exact algorithm for multi depot and multi period vehicle scheduling problem

Kyung Hwan Kang, Young Hoon Lee, Byung Ki Lee

Research output: Contribution to journalConference article

16 Citations (Scopus)

Abstract

This study is on the multi period vehicle scheduling problem in a supply chain where a fleet of vehicle delivers single type product from multi depots to multi retailers. The purpose of this model is to design the least costly schedule of vehicles in each depot to minimize transportation costs for product delivery and inventory holding costs at retailers over the planning period. A mixed integer programming formulation and an exact algorithm are suggested. In the exact algorithm, all feasible schedules are generated from each depot to each retailer and set of vehicle schedules are selected optimally by solving the shortest path problem. The effectiveness of the proposed procedure is evaluated by computational experiment.

Original languageEnglish
Pages (from-to)350-359
Number of pages10
JournalLecture Notes in Computer Science
Volume3483
Issue numberIV
Publication statusPublished - 2005 Sep 26

Fingerprint

Vehicle Scheduling
Exact Algorithms
Scheduling Problem
Schedule
Scheduling
Shortest Path Problem
Mixed Integer Programming
Costs
Supply Chain
Computational Experiments
Integer programming
Planning
Supply chains
Minimise
Formulation
Experiments
Model

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)

Cite this

@article{26bcc68364f74d13b797d2d5fd62ef3d,
title = "An exact algorithm for multi depot and multi period vehicle scheduling problem",
abstract = "This study is on the multi period vehicle scheduling problem in a supply chain where a fleet of vehicle delivers single type product from multi depots to multi retailers. The purpose of this model is to design the least costly schedule of vehicles in each depot to minimize transportation costs for product delivery and inventory holding costs at retailers over the planning period. A mixed integer programming formulation and an exact algorithm are suggested. In the exact algorithm, all feasible schedules are generated from each depot to each retailer and set of vehicle schedules are selected optimally by solving the shortest path problem. The effectiveness of the proposed procedure is evaluated by computational experiment.",
author = "Kang, {Kyung Hwan} and Lee, {Young Hoon} and Lee, {Byung Ki}",
year = "2005",
month = "9",
day = "26",
language = "English",
volume = "3483",
pages = "350--359",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",
number = "IV",

}

An exact algorithm for multi depot and multi period vehicle scheduling problem. / Kang, Kyung Hwan; Lee, Young Hoon; Lee, Byung Ki.

In: Lecture Notes in Computer Science, Vol. 3483, No. IV, 26.09.2005, p. 350-359.

Research output: Contribution to journalConference article

TY - JOUR

T1 - An exact algorithm for multi depot and multi period vehicle scheduling problem

AU - Kang, Kyung Hwan

AU - Lee, Young Hoon

AU - Lee, Byung Ki

PY - 2005/9/26

Y1 - 2005/9/26

N2 - This study is on the multi period vehicle scheduling problem in a supply chain where a fleet of vehicle delivers single type product from multi depots to multi retailers. The purpose of this model is to design the least costly schedule of vehicles in each depot to minimize transportation costs for product delivery and inventory holding costs at retailers over the planning period. A mixed integer programming formulation and an exact algorithm are suggested. In the exact algorithm, all feasible schedules are generated from each depot to each retailer and set of vehicle schedules are selected optimally by solving the shortest path problem. The effectiveness of the proposed procedure is evaluated by computational experiment.

AB - This study is on the multi period vehicle scheduling problem in a supply chain where a fleet of vehicle delivers single type product from multi depots to multi retailers. The purpose of this model is to design the least costly schedule of vehicles in each depot to minimize transportation costs for product delivery and inventory holding costs at retailers over the planning period. A mixed integer programming formulation and an exact algorithm are suggested. In the exact algorithm, all feasible schedules are generated from each depot to each retailer and set of vehicle schedules are selected optimally by solving the shortest path problem. The effectiveness of the proposed procedure is evaluated by computational experiment.

UR - http://www.scopus.com/inward/record.url?scp=24944546744&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24944546744&partnerID=8YFLogxK

M3 - Conference article

VL - 3483

SP - 350

EP - 359

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

IS - IV

ER -