Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Mikhail Batsyn"'
Publikováno v:
International Journal of Production Research. 58:6159-6169
In the current paper we provide a proof of NP-completeness for the Cell Formation Problem (CFP) with the fractional grouping efficacy objective function. First the CFP with a linear objective funct...
Publikováno v:
Operational Research. 21:399-423
In this paper we consider the problem of vehicle assignment in heterogeneous fleet site-dependent Vehicle Routing Problems (VRP) with split deliveries. In such VRP problems vehicles can have different capacities, fixed and travel costs, and site-depe
Publikováno v:
Mathematical Optimization Theory and Operations Research ISBN: 9783030586560
In this paper we propose an efficient heuristic for the Vehicle Routing Problem on Trees (TVRP). An initial solution is constructed with a greedy algorithm based on the Depth-First Search (DFS) approach. To optimize initial solutions obtained by our
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98e0d07b582d3d3680eb5461cb822be5
https://doi.org/10.1007/978-3-030-58657-7_30
https://doi.org/10.1007/978-3-030-58657-7_30
Publikováno v:
International Journal of Production Research. 56:3262-3273
The cell formation problem (CFP) is an NP-hard optimization problem considered for cell manufacturing systems. Because of its high computational complexity several heuristics have been developed for solving this problem. In this paper we present a br
Publikováno v:
Optimization Methods and Software. 32:312-335
This paper describes BBMCW, a new efficient exact maximum clique algorithm tailored for large sparse graphs which can be bit-encoded directly into memory without a heavy performance penalty. These graphs occur in real-life problems when some form of
Publikováno v:
Applied Intelligence. 45:868-880
This paper describes a new initial vertexordering procedure NEW_SORT designed to enhance approximate-colour exact algorithms for the maximum clique problem (MCP). NEW_SORT considers two different vertex orderings: degree and colour-based. The degree-
Publikováno v:
Informatica. 27:463-487
Autor:
Mikhail Batsyn, Alexey Nikolaev
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319946665
IWOCA
IWOCA
In this paper a branch-and-bound algorithm for the Symmetric Travelling Salesman Problem (STSP) is presented. The algorithm is based on the 1-tree Lagrangian relaxation. A new branching strategy is suggested in which the algorithm branches on the 1-t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00d5fb8c038c74735b598cad6ba6f68a
https://doi.org/10.1007/978-3-319-94667-2_26
https://doi.org/10.1007/978-3-319-94667-2_26
Publikováno v:
Springer Proceedings in Mathematics & Statistics ISBN: 9783319962467
One of the approaches for the nearest neighbor search problem is to build a network, which nodes correspond to the given set of indexed objects. In this case, the search of the closest object can be thought as a search of a node in a network. A proce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48954a43fb3aeacd82d1f94809688221
https://doi.org/10.1007/978-3-319-96247-4_14
https://doi.org/10.1007/978-3-319-96247-4_14
Publikováno v:
Springer Proceedings in Mathematics & Statistics ISBN: 9783319962467
The paper presents a tabu search heuristic for the Fleet Size and Mix Vehicle Routing Problem (FSMVRP) with hard and soft time windows. The objective function minimizes the sum of travel costs, fixed vehicle costs, and penalties for soft time window
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::295d3a4e47565a2ff32b38db663b2080
https://doi.org/10.1007/978-3-319-96247-4_1
https://doi.org/10.1007/978-3-319-96247-4_1