Results 41 to 50 of about 3,935 (225)
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 +3 more
core +1 more source
Unconventional GVNS for Solving the Garbage Collection Problem with Time Windows
Technologies, 2019 GVNS, which stands for General Variable Neighborhood Search, is an established and commonly used metaheuristic for the expeditious solution of optimization problems that belong to the NP-hard class. This paper introduces an expansion of the standard GVNS
Christos Papalitsas, Theodore Andronikos
doaj +1 more source
The Kth Traveling Salesman Problem is Pseudopolynomial when TSP is polynomial
CoRR, 2017 6 ...
openaire +2 more sources
N-body Approach to the Traveling Salesman Problem (TSP)
, 2019 19 pages, 19 figures, 2 ...
Seay, Johnny +4 more
openaire +2 more sources
A matheuristic for the traveling salesman problem with positional consistency constraints
International Transactions in Operational Research, EarlyView.Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley +1 more source
Fast reoptimization for the minimum spanning tree problem [PDF]
, 2010 We study reoptimization versions of the minimum spanning tree problem. The reoptimization setting can generally be formulated as follows: given an instance of the problem for which we already know some optimal solution, and given some “small ...
Paschos, Vangelis Th. +4 more
core +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
Algorithms, 2023 With the increasing demand for online shopping and home delivery services, optimizing the routing of electric delivery vehicles in urban areas is crucial to reduce environmental pollution and improve operational efficiency.
Yusef Ahsini +6 more
doaj +1 more source
Solving Travelling Salesman Problem (TSP) by Hybrid Genetic Algorithm (HGA) [PDF]
International Journal of Advanced Computer Science and Applications, 2020 The Traveling Salesman Problem (TSP) is easy to qualify and describe but difficult and very hard to be solved. There is known algorithm that can solve it and find the ideal outcome in polynomial time, so it is NP-Complete problem. The Traveling Salesman Problem (TSP) is related to many others problems because the techniques used to solve it can be ...
openaire +1 more source
International Transactions in Operational Research, EarlyView.Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source