This is an on-line textbook on heuristic algorithms. From the table of contents: Classes of Problems; Integer Programming; Enumeration Techniques; Dynamic Programming; Approximate Solutions; Local Optimization; Natural Models. - free book at FreeComputer
(QAP) is an NP-hard problem which has proven particularly challenging to solve: unlike other combinatorial problems like the traveling salesman problem (TSP), which can be solved to optimality for instances with hundreds or even thousands of locations using advanced integer programming techniques, no...
We shall see later that, even though easy to specify, sometimes it may be difficult to solve problems with this restriction. The methods for formulating and solving problems with integrality requirements are called integer programming. 11.1.1 Types of Variables One general classification is according...
As mentioned above, MAs have a great degree of applicability, as they operate better in solving different problems that involve a computation time restriction, a high-dimensional problem, and other kinds of problems. Specifically, MAs are capable of dealing with different classes of optimization prob...
Summary: This chapter contains short expository notes on applying continuous approaches for solving discrete optimization problems. We discuss some general aspects of the connection between integer programming and continuous optimization problems, along with several specific examples. The considered problems inc...
This paper addresses a class of Traveling Salesman Problems (TSP) in which a route must be made to a series of nodes and return to the original location and attempts to solve it using analytical methods. The problem will be presented as a matrix of routes, much as might be seen in a ...
Whitley L, Starkweather T, ICGA DF, undefined (1989) Scheduling problems and traveling salesmen: the genetic edge recombination operator. In kallisti.net.nz, p 40–133. http://www.kallisti.net.nz/wikifiles/MastersWork/whitleyTSP.ps. Accessed 12 Mar 2023 Atashpaz-Gargari E, Lucas C (2007...
Finally, Section 9 presents the computational results on instances from the literature with a slight adaptation in order to fit the SVOCPDP’s features. 2. Literature review In the literature, similar problems are the One-Commodity Pickup-and-Delivery TSP (1PDTSP) studied in [5] and the ...
2 Oct 2023·Puneet S. Bagga,Arthur Delarue· The Quadratic Assignment Problem (QAP) is an NP-hard problem which has proven particularly challenging to solve: unlike other combinatorial problems like the traveling salesman problem (TSP), which can be solved to optimality for instances with hundreds...
Our computational results show success for the first time in optimally solving defender-attacker-defender TSP problemsLeonardo LozanoJ. Cole SmithMary E. KurzOperations Research LettersLOZANO L, SMITH J C, KURZ M E. Solving the traveling salesman problem with interdiction and fortification [J]. ...