Results 51 to 60 of about 4,258 (228)

Genetic algorithm to the bi-objective multiple travelling salesman problem

Alexandria Engineering Journal
The travelling salesman problem (TSP) and its variants have been studied extensively due to its wide range of real-world applications, yet there are challenges in providing efficient algorithms to deal with some of its variants.
Shayathri Linganathan, Purusotham Singamsetty   +1 more
doaj   +1 more source

Multi‐Agent Reinforcement Learning for Joint Police Patrol and Dispatch

Naval Research Logistics (NRL), EarlyView.
ABSTRACT Police patrol units need to split their time between performing preventive patrol and being dispatched to serve emergency incidents. In the existing literature, patrol and dispatch decisions are often studied separately. We consider joint optimization of these two decisions to improve police operations efficiency and reduce response time to ...
Matthew Repasky, He Wang, Yao Xie
wiley   +1 more source

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

Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem

, 2003
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, Noble, Steven, A.E. Koller, Koller, A.E., Noble, S.D., S.D. Noble, Koller, AE   +6 more
core   +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, EarlyView.
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

Good triangulations yield good tours [PDF]

, 2008
Consider the following heuristic for planar Euclidean instances of the traveling salesman problem (TSP): select a subset of the edges which induces a planar graph, and solve either the TSP or its graphical relaxation on that graph. In this paper, we give
Pearson, N, Letchford, Adam N., Letchford, A N, Pearson, Nicholas A.   +3 more
core   +1 more source

STUDI TENTANG TRAVELLING SALESMAN DAN VEHICLE ROUTING PROBLEM DENGAN TIME WINDOWS

Jurnal Teknik Industri, 2003
The article shows the study of model development of travelling salesman problem. Three models are studied, i.e. travelling salesman problem with time windows, vehicle routing problem, and vehicle routing problem with time windows.
I Nyoman Sutapa, I Gede Agus Widyadana, Christine Christine   +2 more
doaj  

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

Journal of Field Robotics, EarlyView.
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

New techniques for cost sharing in combinatorial optimization games [PDF]

, 2010
Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for such games.
Caprara, A, A. N. Letchford, CAPRARA, ALBERTO, Letchford, A N   +3 more
core   +1 more source

COMPARISON OF PARETO EFFICIENCY AND WEIGHTED OBJECTIVES METHOD TO SOLVE THE MULTI-CRITERIA VEHICLE ROUTING PROBLEM USING THE ARTIFICIAL IMMUNE SYSTEM [PDF]

Applied Computer Science, 2016
The solutions to the multi-criteria vehicle routing problem, dependent on route length and travelling time of delivery van, are presented in the paper. This type of problem is known as a traveling salesman problem. The artificial immune system is used to
Bogna MRÓWCZYŃSKA
doaj