18 February 2021 in Journal of Global Optimization
1 September 2024 in Transportation Science
In last-mile delivery logistics, peer-to-peer logistic platforms play an important role in connecting senders, customers, and independent carriers to fulfill delivery requests. As the carriers are not under the platform’s control, the platform has to anticipate their reactions while deciding how to allocate the delivery operations. Indeed, carriers’ decisions largely affect the platform’s revenue. In this paper, we model this problem using bilevel programming. At the upper level, the platform decides how to assign the orders to the carriers; at the lower level, each carrier solves a profitable tour problem to determine which offered requests to accept, based on her own profit maximization. Possibly, the platform can influence carriers’ decisions by determining also the compensation paid for each accepted request. The two considered settings result in two different formulations: the bilevel profitable tour problem with fixed compensation margins and with margin decisions, respectively. For each of them, we propose single-level reformulations and alternative formulations where the lower-level routing variables are projected out. A branch-and-cut algorithm is proposed to solve the bilevel models, with a tailored warm-start heuristic used to speed up the solution process. Extensive computational tests are performed to compare the proposed formulations and analyze solution characteristics. Funding: The research of E. Fernandez was partially funded through the Spanish Ministerio de Ciencia y Tecnología and European Regional Development Funds (ERDF) [Grant MTM2019-105824GB-I00]. The research of C. Archetti, M. Cerulli, and I. Ljubić was partially funded by CY Initiative of Excellence, France [Grant “Investissements d’Avenir ANR-16-IDEX-0008”]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0129 .
27 September 2024 in Optimization Letters
Solving convex semi-infinite programming (SIP) problems is challenging when the separation problem, namely, the problem of finding the most violated constraint, is computationally hard. We propose to tackle this difficulty by solving the separation problem approximately, i.e., by using an inexact oracle. Our focus lies in two algorithms for SIP, namely the cutting-planes (CP) and the inner-outer approximation (IOA) algorithms. We prove the CP convergence rate to be in O(1/k), where k is the number of calls to the limited-accuracy oracle, if the objective function is strongly convex. Compared to the CP algorithm, the advantage of the IOA algorithm is the feasibility of its iterates. In the case of a semi-infinite program with a Quadratically Constrained Quadratic Programming separation problem, we prove the convergence of the IOA algorithm toward an optimal solution of the SIP problem despite the oracle’s inexactness.
28 April 2023 in European Journal of Operational Research