Results 71 to 80 of about 2,383 (189)

The Railway Traveling Salesman Problem [PDF]

, 2007
We consider theRailwayTraveling SalesmanProblem(RTSP) in which a salesman using the railway network wishes to visit a certain number of cities to carry out his/her business, starting and ending at the same city, and having as goal to minimize the overall time of the journey. RTSP is an NP-hard problem.
Georgia Hadjicharalambous, Petrica C. Pop, Evangelia Pyrga, George Tsaggouris, Christos D. Zaroliagis   +4 more
openaire   +1 more source

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

International Transactions in Operational Research, Volume 33, Issue 6, Page 3714-3743, November 2026.
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

Optimizing Movement Sequences for Step-and-Scan Lithography Equipment

Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2013
The purpose of this work is to improve the throughput of step-and-scan lithography equipment to shorten the production time of a wafer. For this purpose, we propose a method for solving the MSOP (Movement Sequence Optimization Problem), which is the ...
Yuji SHINANO, Nobuo INUI, Youzou FUKAGAWA, Noburu TAKAKURA   +3 more
doaj   +1 more source

Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems

International Transactions in Operational Research, Volume 33, Issue 6, Page 3800-3824, November 2026.
Abstract Given an undirected graph G$G$, a quasi‐clique is a subgraph of G$G$ with density at least γ$\gamma$ (0<γ≤1)$(0 < \gamma \le 1)$. Two optimisation problems can be defined for quasi‐cliques: the maximum quasi‐clique (MQC) problem, which finds a quasi‐clique with maximum vertex cardinality, and the densest k$k$‐subgraph (DKS) problem, which ...
Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins, Luís Paquete   +3 more
wiley   +1 more source

Driver‐Centric Vehicle Routing for Parcel Delivery

Journal of Business Logistics, Volume 47, Issue 4, October 2026.
ABSTRACT One issue parcel delivery drivers are facing in their workplace is the limited access to restrooms. Because drivers are constantly pressured to meet the demanding performance standards called work quotas, they have little time to visit restrooms while working, often forcing them to urinate into bottles in the back of their trucks.
Yoshinori Suzuki, Bo Lan
wiley   +1 more source

On One Implementation of a Natural Approach to Solving the Traveling Salesman Problem

Кібернетика та комп'ютерні технології
Introduction. The relevance of the traveling salesman problem is associated with the need to develop computational schemes for use in situations that require the analysis of information of a sufficiently large volume.
Dmitri Terzi
doaj   +1 more source

Trajectory Stability in the Traveling Salesman Problem

Complexity, 2018
Two generalizations of the traveling salesman problem in which sites change their position in time are presented. The way the rank of different trajectory lengths changes in time is studied using the rank diversity.
Sergio Sánchez, Germinal Cocho, Jorge Flores, Carlos Gershenson, Gerardo Iñiguez, Carlos Pineda   +5 more
doaj   +1 more source

Self‐Service and Home Delivery Combined: Coordinating the Route of a Mobile Parcel Locker With the Delivery Tasks of Its Human Driver

Networks, Volume 88, Issue 2, Page 192-210, September 2026.
ABSTRACT In response to the increasing volume of parcels, last‐mile delivery innovations are exploring the integration of multiple delivery modes. The most prominent examples are delivery vans that, next to being the base for the delivery tasks of their human drivers, also function as mobile launching platforms for drones or autonomous delivery robots.
Nils Boysen, Dirk Briskorn, Stefan Schwerdfeger   +2 more
wiley   +1 more source

Redefining Optimal Coverage Path Planning for FLS‐Equipped AUVs With Deep Reinforcement Learning

Journal of Field Robotics, Volume 43, Issue 6, Page 3617-3632, September 2026.
ABSTRACT Autonomous Underwater Vehicles (AUVs) have emerged as indispensable tools for a variety of subsea tasks, from habitat monitoring and seabed mapping to infrastructure inspection and mine countermeasures. A fundamental challenge in this field is Coverage Path Planning (CPP), the problem of ensuring complete and efficient area coverage.
Lorenzo Cecchi, Alberto Topini, Alessandro Bucci, Alessandro Ridolfi   +3 more
wiley   +1 more source

Parental Support for Chinese Young Students' EFL Learning: A Perspective of Socio‐Economic Status

European Journal of Education, Volume 61, Issue 3, September 2026.
ABSTRACT Previous research has examined the link between parental support and their children's learning achievement, but knowledge of how parental support is influenced by their socio‐economic status (SES) is limited. Using an open‐ended questionnaire and semi‐structured interview, this study investigated primary school students' perceptions of ...
Haiyuan Chen, Yanqun Huang, Zhenhui Rao
wiley   +1 more source