Approximation algorithms for some extensions of the maximum profit routing problem

Bogdan Armaselu ()

Journal of Combinatorial Optimization, 2023, vol. 45, issue 1, No 18, 22 pages

Abstract: Abstract In this paper, we consider extensions of the Maximum-Profit Public Transportation Route Planning Problem, or simply Maximum-Profit Routing Problem (MPRP), introduced in Armaselu and Daescu (Approximation algorithms for the maximum profit pick-up problem with time windows and capacity constraint, 2016. arXiv:1612.01038 , Interactive assisting framework for maximum profit routing in public transportation in smart cities, PETRA, 13–16, 2017). Specifically, we consider MPRP with Time-Variable Supply (MPRP-VS), in which the quantity $$q_i(t)$$ q i ( t ) supplied at site i is linearly increasing in time t, as opposed to the original MPRP problem, where the quantity is constant in time. For MPRP-VS, our main result is a $$5.5 \log {T} (1 + \epsilon ) \left( 1 + \frac{1}{1 + \sqrt{m}}\right) ^2$$ 5.5 log T ( 1 + ϵ ) 1 + 1 1 + m 2 approximation algorithm, where T is the latest time window and m is the number of vehicles used. We also study the MPRP with Multiple Vehicles per Site, in which a site may be visited by a vehicle multiple times, which can have 2 flavors: with quantities fixed in time (MPRP-M), and with time-variable quantities (MPRP-MVS). Our algorithmic solution to MPRP-VS can also improve upon the MPRP algorithm in Armaselu and Daescu (2017) under certain conditions. In addition, we simulate the MPRP-VS algorithm on a few benchmark, real-world, and synthetic instances.

Keywords: Routing; Maximum-profit; Variable supply; Multiple vehicles; APX (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00944-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:45:y:2023:i:1:d:10.1007_s10878-022-00944-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-022-00944-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().