Results 71 to 80 of about 5,636,127 (168)
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 +3 more
doaj +1 more source
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 +1 more
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
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 +3 more
wiley +1 more source
On‐Time Meal Delivery Assisted by Drone Resupply
Naval Research Logistics (NRL), Volume 73, Issue 7, Page 1047-1066, October 2026.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
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 +5 more
doaj +1 more source
A Branch‐and‐Price Algorithm for the Symmetric Electric Traveling Salesman Problem
Networks, Volume 88, Issue 3, Page 354-368, October 2026.ABSTRACT The Electric Traveling Salesman Problem (ETSP) is a variant of the well‐known TSP in which an electric vehicle must visit a set of customers minimizing the total cost of its route. The vehicle is assumed to be equipped with a battery of limited capacity that may need to be recharged along the route.
Alberto Ceselli +2 more
wiley +1 more source
An empirical investigation into randomly generated Euclidean symmetric traveling salesman problems [PDF]
The traveling salesman problem is one of the most well-solved hard combinatorial optimization problems. Any new algorithm or heuristic for the traveling salesman problem is empirically evaluated based on its performance on standard test instances, as ...
Sharma, Megha, Ghosh, Diptesh
core
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
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