TY - GEN
T1 - Routing and scheduling employee transportation using tabu search
AU - Purba, Ari Pranata
AU - Siswanto, Nurhadi
AU - Rusdiansyah, Ahmad
N1 - Publisher Copyright:
© 2020 Author(s).
PY - 2020/4/13
Y1 - 2020/4/13
N2 - A company has various ways to make employees feel safe and comfortable while working. One of the policies adopted by the company in this case study is to provide buses as facilities for employees to pick them up from several locations and drop them off at different points. This paper seeks to implement the development of Vehicle Routing Problem Split Delivery with Time Windows (VRPSDTW). Routing and scheduling employee transportation is an NP-Hard problem, which is difficult to solve with conventional methods and requires a long computational time to obtain the optimal solution, because this research has many constraints that must be solved. The study proposed to use Tabu Search with two scenarios, which is variation in the number and the locations of the bus starting points. The resulting solution is better than the existing scheduling implemented by the company, in the case it is also able to reduce fuel costs by 8% for Scenario 1 and by 7% for Scenario 2, as obtained from the total distance traveled by shorter buses.
AB - A company has various ways to make employees feel safe and comfortable while working. One of the policies adopted by the company in this case study is to provide buses as facilities for employees to pick them up from several locations and drop them off at different points. This paper seeks to implement the development of Vehicle Routing Problem Split Delivery with Time Windows (VRPSDTW). Routing and scheduling employee transportation is an NP-Hard problem, which is difficult to solve with conventional methods and requires a long computational time to obtain the optimal solution, because this research has many constraints that must be solved. The study proposed to use Tabu Search with two scenarios, which is variation in the number and the locations of the bus starting points. The resulting solution is better than the existing scheduling implemented by the company, in the case it is also able to reduce fuel costs by 8% for Scenario 1 and by 7% for Scenario 2, as obtained from the total distance traveled by shorter buses.
UR - http://www.scopus.com/inward/record.url?scp=85084148978&partnerID=8YFLogxK
U2 - 10.1063/5.0000766
DO - 10.1063/5.0000766
M3 - Conference contribution
AN - SCOPUS:85084148978
T3 - AIP Conference Proceedings
BT - 5th International Conference on Industrial, Mechanical Electrical, and Chemical Engineering 2019, ICIMECE 2019
A2 - Sutopo, Wahyudi
A2 - Anwar, Miftahul
A2 - Ibrahim, Muhammad Hamka
A2 - Maghfiroh, Hari
A2 - Apribowo, Chico Hermanu Brilianto
A2 - Ibrahim, Sutrisno
A2 - Hisjam, Muhammad
PB - American Institute of Physics Inc.
T2 - 5th International Conference on Industrial, Mechanical Electrical, and Chemical Engineering 2019, ICIMECE 2019
Y2 - 17 September 2019 through 18 September 2019
ER -