Results 51 to 60 of about 5,666,790 (163)
On‐Time Meal Delivery Assisted by Drone Resupply
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
A Branch‐and‐Price Algorithm for the Symmetric Electric Traveling Salesman Problem
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
Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm [PDF]
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution.
Hossein Larki, Majid Yousefikhoshbakht
doaj
In the carrier-based coverage repair problem, a single mobile robot replaces damaged sensors by picking up spare ones in the region of interest or carrying them from a base station in wireless sensor and robot networks.
Kun Miao +3 more
doaj +1 more source
Driver‐Centric Vehicle Routing for Parcel Delivery
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
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem [PDF]
We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +6 more
core +1 more source
In this paper, we propose new heuristic methods for solver the Clustered Traveling Salesman Problem (CTSP). The CTSP is a generalization of the Traveling Salesman Problem (TSP) in which the set of vertices is partitioned into disjoint clusters and ...
Mário Mestria
doaj +1 more source
Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley +1 more source
Study of TSP based on self-organizing map
Self-organizing map(SOM) proposed by Kohonen has obtained certain achievements in solving the traveling salesman problem(TSP).To improve Kohonen SOM,an effective initialization and parameter modification method is discussed to obtain a faster convergence
SONG Jin-juan +2 more
doaj
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 +2 more
wiley +1 more source

