Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previo...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...