Results 101 to 110 of about 4,258 (228)
IEEE AccessFirefly Algorithm (FA) mimics the flashing light characteristic of fireflies to solve optimization problems. An area where its utilization is limited is Travelling Salesman Problem (TSP).
Ravneil Nand +2 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
Zero-one IP problems: Polyhedral descriptions & cutting plane procedures
, 1994 A systematic way for tightening an IP formulation is by employing classes of linear inequalities that define facets of the convex hull of the feasible integer points of the respective problems.
Mitra, G, Yarrow, L, Abdul-Hamid, F
core
A DISTRIBUTED APPROACH TO ANT COLONY OPTIMIZATION [PDF]
Swarm Intelligence(SI) is the emergent collective intelligence of groups of simple agents. Economy is an example of SI. Simulating an economy using Ant Colony algorithms would allow prediction and control of fluctuations in the complex emergent behavior ...
Eng. Sorin Ilie Ph. D Student +1 more
core
The Travelling Salesman Problem and Related Problems [PDF]
, 1978 New formulations are presented for the Travelling Salesman problem, and their relationship to previous formulations is investigated. The new formulations are extended to include a variety of transportation scheduling problems, such as the Multi ...
Graves, Stephen C., Gavish, Bezalel
core
Approaches for solving some scheduling and routing problems
, 2009 We study approaches for finding good solutions, and lower bounds, for three difficult combinatorial optimisation problems.The supply ship travelling salesman problem is a simplification of a situation faced by a naval logistics coordinator who must ...
Drake, Andrew John
core
Evolutionary computation applied to combinatorial optimisation problems [PDF]
, 2007 This thesis addresses the issues associated with conventional genetic algorithms (GA) when applied to hard optimisation problems. In particular it examines the problem of selecting and implementing appropriate genetic operators in order to meet the ...
Mitchell, George G.
core
Insertion Heuristics for Central Cycle Problems [PDF]
, 2006 A central cycle problem requires a cycle that is reasonably short and keeps a the maximum distance from any node not on the cycle to its nearest node on the cycle reasonably low.
Lamb, John Douglas
core
Amoeba-inspired analog electronic computing system integrating resistance crossbar for solving the travelling salesman problem. [PDF]
Sci Rep, 2020 Saito K, Aono M, Kasai S.
europepmc +1 more source
On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)
AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;semidefinite programming;quadratic as- signment ...
Klerk, E. de +2 more
core