Results 41 to 50 of about 4,732 (227)
Solving the Travelling Salesman Problem by Using Artificial Bee Colony Algorithm
Journal of Computing Research and Innovation, 2022 Travelling Salesman Problem (TSP) is a list of cities that must visit all cities that start and end in the same city to find the minimum cost of time or distance. The Artificial Bee Colony (ABC) algorithm was used in this study to resolve the TSP.
Siti Hafawati Jamaluddin +3 more
doaj +3 more sources
Basic Evolutionary Approach to the Traveling Salesman Problem
U.Porto Journal of Engineering, 2015 Evolutionary programming (EP) is a metaheuristic method developed as an alternative approach to artificial intelligence. The aim of this paper is to bring an introduction to EP algorithms through the implementation of the basic D. B. Fogel’s Evolutionary
Débora Regina de São José +1 more
doaj +1 more source
Learned Upper Bounds for the Time-Dependent Travelling Salesman Problem
IEEE Access, 2023 Fleet management plays a central role in several application contexts such as distribution planning, mail delivery, garbage collection, salt gritting, field service routing. Since road congestion has a big impact on driving times, fleet management can be
Tommaso Adamo +3 more
doaj +1 more source
Some new results on the travelling salesman problem
Vallis Aurea, 2015 The travelling salesman problem (or The sales representative problem) has been insufficiently explored so far. One of the first results on this issue was provided by Euler in 1759 (The problem of moving a knight on the chess board), Knight's Tour Problem.
Dominika Crnjac Milić +1 more
doaj +1 more source
IMPLEMENTASI ALGORITMA BEE COLONY UNTUK OPTIMASI RUTE DISTRIBUSI CARICA NIDA FOOD WONOSOBO
Sistemasi: Jurnal Sistem Informasi, 2019 “Nida Food” merupakan UMKM produksi carica, memiliki permasalahan dalam menentukan rute minimum untuk mendistribusikan produksi carica ke semua konsumen.
Muhammad Darwis Arifin, Arif Dwi Laksito
doaj +1 more source
Advanced Electronic Materials, EarlyView.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
Business Strategy and the Environment, EarlyView.ABSTRACT This study demonstrates how a profitable, lean, and environmentally responsible e‐waste reverse logistics system can be designed using integrated Operations Research (OR) techniques. Addressing the growing urgency of responsible consumption (UN SDG 12) and the projected rise of the e‐waste sector to USD 137.60 billion by 2029, the research ...
Sheeba Pathak, Hajar Fatorachian
wiley +1 more source
Linearity in the Traveling Salesman Problem
Applied Mathematics Letters, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruce W. Colletti, J. Wesley Barnes
openaire +2 more sources
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
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