A benchmark dataset for the multiple depot vehicle scheduling problem.

Autor:	Kulkarni S; IITB-Monash Research Academy, IIT Bombay, Powai, Mumbai 400076, India.; SJM School of Management, IIT Bombay, Powai, Mumbai 400076, India.; School of Mathematical Sciences, Monash University, Clayton, VIC 3800, Australia., Krishnamoorthy M; Department of Mechanical and Aerospace Engineering, Monash University, Clayton, VIC 3800, Australia.; School of Information Technology and Electrical Engineering, The University of Queensland, QLD 4072, Australia., Ranade A; Department of Computer Science and Engineering, IIT Bombay, Powai, Mumbai 400076, India., Ernst AT; School of Mathematical Sciences, Monash University, Clayton, VIC 3800, Australia., Patil R; SJM School of Management, IIT Bombay, Powai, Mumbai 400076, India.
Jazyk:	angličtina
Zdroj:	Data in brief [Data Brief] 2018 Dec 18; Vol. 22, pp. 484-487. Date of Electronic Publication: 2018 Dec 18 (Print Publication: 2019).
DOI:	10.1016/j.dib.2018.12.055
Abstrakt:	This data article presents a description of a benchmark dataset for the multiple depot vehicle scheduling problem (MDVSP). The MDVSP is to assign vehicles from different depots to timetabled trips to minimize the total cost of empty travel and waiting. The dataset has been developed to evaluate the heuristics of the MDVSP that are presented in "A new formulation and a column generation-based heuristic for the multiple depot vehicle scheduling problem" (Kulkarni et al., 2018). The dataset contains 60 problem instances of varying size. Researchers can use the dataset to evaluate the future algorithms for the MDVSP and compare the performance with the existing algorithms. The dataset includes a program that can be used to generate new problem instances of the MDVSP.
Databáze:	MEDLINE
Externí odkaz:	Zobrazit plný text záznamu