SCITEPRESS (original) (raw)
Paper
The multi-Depot multiple Set Orienteering Problem: An Integer Linear Programming Formulation
Topics: Linear Programming; New Applications of OR; Optimization; OR in Logistics, Maintenance, and Supply; OR in Transportation; Simulation
Ravi Kant and Abhishek Mishra
Affiliation: Department of CSIS, Birla Institute of Technology and Science, Pilani, 333031, India
Keyword(s): Traveling Salesman Problem (TSP), Orienteering Problem (OP), Set Orienteering Problem (SOP), Sub-tour Elimination Constraints (SEC).
Abstract: In this article, we introduce a novel variant of the single Depot multiple Set Orienteering Problem (sDmSOP), which we refer to as the multi-Depot multiple Set Orienteering Problem (mDmSOP). We suggest the integer linear program (ILP) of the mDmSOP also, and analyze the impact of the Sub-tour Elimination Constraints (SECs) based on the Miller–Tucker–Zemlin (MTZ) and the Gavish-Graves (GG) model on it. The mDmSOP is most frequently encountered in distribution logistics. In mDmSOP, a fleet of travelers is utilized to serve a set of customers from a number of depots, with each traveler associated with a specific depot. The challenge is to choose the routes for each traveler to maximize the profit within a specific budget, while the profit can be earned from a set of customers only once by visiting exactly one customer. We show the simulation results conducted on the General Algebraic Modeling System (GAMS) 39.0.2, which is used to model and analyze linear, non-linear, mixed-integer, and other complex optimization problems. The Generalized Traveling Salesman Problem (GTSP) instances of up to 200 vertices are taken as the input data set for the simulations. The results show that the MTZ-based formulation takes less time than the GG-based formulation to converge to the optimal solution for the mDmSOP. (More)
In this article, we introduce a novel variant of the single Depot multiple Set Orienteering Problem (sDmSOP), which we refer to as the multi-Depot multiple Set Orienteering Problem (mDmSOP). We suggest the integer linear program (ILP) of the mDmSOP also, and analyze the impact of the Sub-tour Elimination Constraints (SECs) based on the Miller–Tucker–Zemlin (MTZ) and the Gavish-Graves (GG) model on it. The mDmSOP is most frequently encountered in distribution logistics. In mDmSOP, a fleet of travelers is utilized to serve a set of customers from a number of depots, with each traveler associated with a specific depot. The challenge is to choose the routes for each traveler to maximize the profit within a specific budget, while the profit can be earned from a set of customers only once by visiting exactly one customer. We show the simulation results conducted on the General Algebraic Modeling System (GAMS) 39.0.2, which is used to model and analyze linear, non-linear, mixed-integer, and other complex optimization problems. The Generalized Traveling Salesman Problem (GTSP) instances of up to 200 vertices are taken as the input data set for the simulations. The results show that the MTZ-based formulation takes less time than the GG-based formulation to converge to the optimal solution for the mDmSOP.
Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.
Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.
Guest:Register as new SciTePress user now for free.
Download limit per month - 500 recent papers or 4000 papers more than 2 years old.
SciTePress user: please login.
You are not signed in, therefore limits apply to your IP address 136.107.46.232
In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total
Paper citation in several formats:
Kant, R. and Mishra, A. (2024). The multi-Depot multiple Set Orienteering Problem: An Integer Linear Programming Formulation. In Proceedings of the 13th International Conference on Operations Research and Enterprise Systems - ICORES; ISBN 978-989-758-681-1; ISSN 2184-4372, SciTePress, pages 350-355. DOI: 10.5220/0012420500003639
@conference{icores24,
author={Ravi Kant and Abhishek Mishra},
title={The multi-Depot multiple Set Orienteering Problem: An Integer Linear Programming Formulation},
booktitle={Proceedings of the 13th International Conference on Operations Research and Enterprise Systems - ICORES},
year={2024},
pages={350-355},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012420500003639},
isbn={978-989-758-681-1},
issn={2184-4372},
}
TY - CONF
JO - Proceedings of the 13th International Conference on Operations Research and Enterprise Systems - ICORES
TI - The multi-Depot multiple Set Orienteering Problem: An Integer Linear Programming Formulation
SN - 978-989-758-681-1
IS - 2184-4372
AU - Kant, R.
AU - Mishra, A.
PY - 2024
SP - 350
EP - 355
DO - 10.5220/0012420500003639
PB - SciTePress