Results 71 to 80 of about 1,705 (196)
A unified matheuristic for solving multi-constrained traveling salesman problems with profits
EURO Journal on Computational Optimization, 2017 In this paper, we address a rich Traveling Salesman Problem with Profits encountered in several real-life cases. We propose a unified solution approach based on variable neighborhood search.
Rahma Lahyani +2 more
doaj +1 more source
The impact of public drop‐off boxes and autonomous delivery robots in last‐mile delivery
International Transactions in Operational Research, Volume 33, Issue 6, Page 3825-3854, November 2026.Abstract The growing concern over emissions from last‐mile logistics is motivating the development of innovative delivery models aimed at reducing environmental impact and traffic congestion. To this end, we propose a last‐mile delivery scheme based on both public drop‐off boxes and autonomous delivery robots.
Gianpaolo Ghiani +3 more
wiley +1 more source
IEEE AccessThis paper proposes a novel solution technique using a matheuristic approach to address the expansion planning of modern distribution systems. The planning problem can be accurately modeled as a non-convex mixed-integer non-linear programming (MINLP ...
Jonathan A. Marcelo +3 more
doaj +1 more source
Production routing decisions in a two‐echelon supply chain with multiple delivery modes
International Transactions in Operational Research, Volume 33, Issue 5, Page 3385-3421, September 2026.Abstract We study an original two‐echelon production routing problem with multiple delivery modes (2E‐PRP‐MDM). In the first echelon, the primary production facility is tasked with satisfying the demands of two distinct entities: a set of warehouses and a set of customers through direct shipments. In the second echelon, warehouses become delivery hubs,
Rachida Benfedel +2 more
wiley +1 more source
Shaping Decision Models for Stochastic Dynamic Optimization Problems via Reinforcement Learning
Networks, Volume 88, Issue 1, Page 138-157, July 2026.ABSTRACT With rising customer expectations and increasing computational potential, many transport, manufacturing, and production operations face real‐time decision making in stochastic dynamic environments. Decision makers must find and adapt complex plans that are effective now but also flexible with respect to future developments.
Florentin D. Hildebrandt +3 more
wiley +1 more source
, 2011 Many problems arising in different areas such as production or distribution of goods and services are combinatorial optimization problems (COPs). Many examples can be made for all areas: • Production Scheduling (flow shop, job shop, open shop, etc ...
Salassa, Fabio Guido Mario
core +1 more source
A matheuristic for the Team Orienteering Arc Routing Problem [PDF]
European Journal of Operational Research, 2015 Angel Corberan, Isaac Plana and Jose M. Sanchis wish to thank the Ministerio de Economia y Competitividad (project MTM2012-36163-C06-02) of Spain and the Generalitat Valenciana (project GVPROMETEO2013-049) for their support.
Claudia Archetti +4 more
openaire +4 more sources
Scenario‐Based Platoon Lane Network Design
Networks, Volume 87, Issue 4, Page 443-459, June 2026.ABSTRACT A truck platoon is a set of trucks that drive behind one another at short headways to save fuel, reduce emissions, and improve traffic throughput. Despite the potential benefits of platooning, road operators have raised concerns about the impact of platoons on surrounding traffic.
Anirudh Kishore Bhoopalam +2 more
wiley +1 more source
Matheuristics for a multi-day electric bus assignment and overnight recharge scheduling problem
, 2022 International audienceTo limit greenhouse gas emissions in the public transportation sector, transit authorities are constantly increasing the proportion of electric buses (EBs) in their fleets.
Mendoza, Jorge +6 more
core +1 more source
The team orienteering problem with variable time windows
International Transactions in Operational Research, Volume 33, Issue 3, Page 1705-1732, May 2026.Abstract The orienteering problem is well‐established within the domain of operational research. This paper introduces the team orienteering problem with variable time windows (TOPVTW) as a new variant of the team orienteering problem with time windows. The distinguishing feature of the TOPVTW is the adaptive time windows, which evolve dynamically as a
Bibiana Granda, Begoña Vitoriano
wiley +1 more source