LastMile-TestSet

Introduction

MERL Last Mile Problem Set

At a Glance

The size of the unzipped dataset is ~5.3MB

The dataset contains the instances used in the manuscript "Seamless Multimodal Transportation Scheduling" by Raghunathan, Bergman, Hooker, Serra, and Kobori (see Citation section).

Files in the unzipped folder:

./README.md

express_500_10: Folder with instances.

express_750_10: Folder with instances.

express_1250_25: Folder with instances.

express_1875_25: Folder with instances.

ProblemObjectiveInformation.xlsx: Provides information on each problem instance including the optimal solution.

regular_1000_10: Folder with instances.

regular_1500_10: Folder with instances.

regular_2000_10: Folder with instances.

regular_2500_25: Folder with instances.

regular_3750_25: Folder with instances.

regular_5000_25: Folder with instances.

regular_5000_50: Folder with instances.

regular_7500_50: Folder with instances.

regular_10000_50: Folder with instances.

The instances of this problem set are organized in folders with names following the pattern regular_NP_ND and express_NP_ND, where NP and ND are the number of passengers and the number of destinations in the instances of the corresponding folder. Folders that begin with "regular" have uniform mass transportation service for all origins. Folders that begin with "express" have better mass transportation service for certain origins, as described below.

Other Details

In each folder, we have files with names following the patterns merl_lastmile_demand_NP_ND_TW_I.txt, merl_lastmile_arrivals_NP_ND.txt, and merl_lastmile_network_NP_ND.txt, where NP and ND are the number of passengers and the number of destinations as before. In addition, TW is the size of the time window (in minutes) and I is the number of the instance (from 1 to 5). Every instance corresponds to a combination of the passenger demands in each file that begins with "merl_lastmile_demand" along with the mass transportation services in the file that begin with "merl_lastmile_arrivals" and the last mile routes to each destination in the file that begins with "merl_last_mile_network". Those latter two files are unique in each folder and they can differ from the corresponding files in other folders that describe instances with the same number of destinations ND.

Each file that begins with "merl_lastmile_demand" has the following structure. The first line contains the number N of mass transportation stations used as origin for the passengers. These stations are numbered from 1 to N. The second line contains the number M of locations used as last mile destinations for the passengers. These locations are numbered from 1 to M. The third line contains the number P of passengers. The next P lines describe the relevant information of each passenger as 4 integer numbers: their station of origin, last mile destination, earliest time for arrival at destination, and latest time for arrival at destination. Please note that those times are given in integer units that are multiples of 30 seconds.

Each file that begins with "merl_lastmile_arrivals" has the following structure. The first line containts the number N of mass transportation stations used as origin for the passengers. These stations are numbered from 1 to N. The remaining lines describe transportation legs taking each passenger from their station of original to the alighting terminal in which they should board for their last mile trip. Each line describes a mass transit leg as 3 integer numbers: the station of origin, the departure time from the state of origin, and the arrival time at the alighting terminal. In practice, you can assume that all legs with the same arrival time correspond to a single mass transportation service. In the folders that begin with "express", the departure time for certain stations of origin is a very large negative number. That implies that, in practice, that mass transportation service does not serve the corresponding station. Please note that those times are given in integer units that are multiples of 30 seconds.

Each file that begins with "merl_lastmile_network" has the following structure. The first line contains the number M of locations used as last mile destinations for the passengers. These locations are numbered from 1 to M. The second line contains the number L of time units for loading and unloading of passengers in the last mile service. This time should be added after the conclusion of every operation of loading or unloading passengers in the last mile service. The third line contains the number R of routes used for last mile service. Those routes are numbers from 0 to R-1. The remaining lines describe those routes by providing the times, relative to departure from the alighting terminal, that it takes for a given route to be in different locations. Each line describes that as 3 integer numbers: the last mile route in use, the last mile location, and the time relative to departure for reaching that location. Every route begins and ends at the alighting terminal, which is denoted as 0. The first line for each route has a time 0 at the alighting terminal and the last line for each route has the time to arrive back at the alighting terminal. Please note that those times as well as the duration L are given in integer units that are multiples of 30 seconds.

Certain parameters of the experiments are not described in those files, such as the number and capacity of last mile vehicles. The coefficient alpha that is used to balance between minimizing passenger travel time and number of trips using last mile vehicles is also not given. The values described for those parameters are tested with all instances.

Citation

If you use LastMile-TestSet in your research, please cite our paper:

@misc{raghunathan2022seamless,
title={Seamless Multimodal Transportation Scheduling},
author={Arvind U Raghunathan and David Bergman and John Hooker and Thiago Serra and Shingo Kobori},
year={2022},
eprint={1807.09676},
archivePrefix={arXiv},
primaryClass={math.OC}
}

Copyright and License

The LastMile-TestSet dataset is released under CC-BY-SA-4.0 license.

All data:

Created by Mitsubishi Electric Research Laboratories (MERL), 2020,2023

SPDX-License-Identifier: CC-BY-SA-4.0