The selective travelling salesman problem
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Computers and Operations Research
The vehicle routing problem
A tabu scatter search metaheuristic for the arc routing problem
Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Solving the Orienteering Problem Through Branch-And-Cut
INFORMS Journal on Computing
Scatter Search: Methodology and Implementations in C
Scatter Search: Methodology and Implementations in C
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
A new hybrid heuristic approach for solving large traveling salesman problem
Information Sciences—Informatics and Computer Science: An International Journal
Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
Computers and Operations Research
Computers and Operations Research
A hybrid electromagnetism-like algorithm for single machine scheduling problem
Expert Systems with Applications: An International Journal
Applying hybrid meta-heuristics for capacitated vehicle routing problem
Expert Systems with Applications: An International Journal
A hybrid search algorithm with heuristics for resource allocation problem
Information Sciences: an International Journal
Variable neighborhood search for the orienteering problem
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Information Sciences: an International Journal
Hi-index | 0.01 |
This paper investigates a single machine scheduling problem with strong industrial background, named the prize-collecting single machine scheduling problem with sequence-dependent setup times. In this problem, there are n candidate jobs for processing in a single machine, each job has a weight (or profit) and a processing time, and during processing a symmetric sequence-dependent setup time exists between two consecutive jobs. Since there is a maximum available time limitation of the machine, it is generally impossible to complete the processing of all the candidate jobs within this time limitation. The objective is to find a job processing sequence of maximal job weights (or profits) over a subset of all candidate jobs whose makespan does not exceed the given time limitation. This problem can be considered as an application of the orienteering problem (OP) in the field of discrete manufacturing. We formulate this problem as a mixed integer linear programming (MILP) model and propose a hybrid metaheuristic combining the structures of scatter search and variable neighborhood search. Computational results on a large number of randomly generated instances with different structures show that the proposed hybrid metaheuristic outperforms CPLEX and two metaheuristics proposed for the OP.