Results 41 to 50 of about 15,296 (207)

On‐Time Meal Delivery Assisted by Drone Resupply

Naval Research Logistics (NRL), EarlyView.
ABSTRACT Ensuring timely delivery is crucial with the increasing competition in online meal delivery services. This requires the industry to adopt new technologies and the corresponding operational models, including the use of drones. Concerning the desired features of meal delivery, such as safety and reliability, we propose an operational model that ...
Wenqian Liu, Lindong Liu, Xiangtong Qi
wiley   +1 more source

The Electric Vehicle Traveling Salesman Problem on Digital Elevation Models for Traffic-Aware Urban Logistics

Algorithms, 2023
With the increasing demand for online shopping and home delivery services, optimizing the routing of electric delivery vehicles in urban areas is crucial to reduce environmental pollution and improve operational efficiency.
Yusef Ahsini, Pablo Díaz-Masa, Belén Inglés, Ana Rubio, Alba Martínez, Aina Magraner, J. Alberto Conejero   +6 more
doaj   +1 more source

Ordered Median Traveling Salesman Problem

Networks, EarlyView.
ABSTRACT This paper introduces a novel combinatorial optimization problem with ordering constraints, termed the Ordered Median Traveling Salesman Problem (OMTSP). The OMTSP integrates key elements from both the classic Traveling Salesman Problem (TSP) and the Ordered Median Location Problem.
Ivana Ljubić, Alfredo Marín, Justo Puerto, Francisco Temprano   +3 more
wiley   +1 more source

Unconventional GVNS for Solving the Garbage Collection Problem with Time Windows

Technologies, 2019
GVNS, which stands for General Variable Neighborhood Search, is an established and commonly used metaheuristic for the expeditious solution of optimization problems that belong to the NP-hard class. This paper introduces an expansion of the standard GVNS
Christos Papalitsas, Theodore Andronikos
doaj   +1 more source

A matheuristic for the traveling salesman problem with positional consistency constraints

International Transactions in Operational Research, EarlyView.
Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley   +1 more source

New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP) [PDF]

Journal of Optimization in Industrial Engineering, 2010
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution.
Ellips Masehian
doaj  

The using of solver software and vehicle routing for the traveling salesman problem [PDF]

, 2014
The traveling salesman problem (TSP) is one of the most studied problems in management science. Optimal approaches to solving traveling salesman problems are based on mathematical programming.
Dzidrov, Misko, Krstev, Aleksandar, Krstev, Boris, Krstev, Dejan, Pavlov, Sashe, Pop-Andonov, Goran   +5 more
core  

A formulation and a metaheuristic approach for the clustered vehicle routing problem with d‐relaxed priority rule

International Transactions in Operational Research, EarlyView.
Abstract This paper investigates an extension of the vehicle routing problem in which, in addition to minimizing the distance traveled, the sequencing of customer visits is subject to precedence constraints that impose visiting priorities among customers.
Eduardo dos Santos Teixeira, Silvio Alexandre de Araujo   +1 more
wiley   +1 more source

The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme

, 2015
The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+eps)-approximation to the optimal tour, for any fixed eps>0, in TSP ...
Abraham I., Arora S., Assouad P., Bartal Y., Bartal Y., Bartal Y., Chan T-H. H., Chan T-H. H., Czumaj A., Czumaj A., Fakcharoenphol J., Gao J., Gottlieb L.-A., Gottlieb L.-A., Gottlieb L.-A., Gupta A., J. S., Lampis M., Lee-Ad Gottlieb, Rao S. B., Robert Krauthgamer, Talwar K., Yair Bartal   +22 more
core   +1 more source

Exact and metaheuristic approaches to minimizing makespan in parallel machine scheduling with conflicting jobs

International Transactions in Operational Research, EarlyView.
Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati, Dinh Quy Ta, Minh Hoàng Hà, Andrea Schaerf   +3 more
wiley   +1 more source