The Experts below are selected from a list of 52023 Experts worldwide ranked by ideXlab platform
Mohammad A. Al-fawzan - One of the best experts on this subject based on the ideXlab platform.
-
A Tabu search approach for the flow shop scheduling problem
European Journal of Operational Research, 1998Co-Authors: Mohamed Ben-daya, Mohammad A. Al-fawzanAbstract:In this paper, we propose a Tabu search approach for solving the permutation flow shop scheduling problem. The proposed implementation of the Tabu search approach suggests simple techniques for generating neighborhoods of a given sequence and a combined scheme for intensification and diversification that has not been considered before. These new features result in an implementation that improves upon previous Tabu search implementations that use mechanisms of comparable simplicity. Also, better results were obtained than those produced by a simulated annealing algorithm from the literature.
Jeanyves Potvin - One of the best experts on this subject based on the ideXlab platform.
-
a Tabu search heuristic for the vehicle routing problem with soft time windows
Transportation Science, 1997Co-Authors: Eric D Taillard, Michel Gendreau, Philippe Badeau, Francois Guertin, Jeanyves PotvinAbstract:This paper describes a Tabu search heuristic for the vehicle routing problem with soft time windows. In this problem, lateness at customer locations is allowed although a penalty is incurred and added to the objective value. By adding large penalty values, the vehicle routing problem with hard time windows can be addressed as well. In the Tabu search, a neighborhood of the current solution is created through an exchange procedure that swaps sequences of consecutive customers (or segments) between two routes. The Tabu search also exploits an adaptive memory that contains the routes of the best previously visited solutions. New starting points for the Tabu search are produced through a combination of routes taken from different solutions found in this memory. Many best-known solutions are reported on classical test problems.
Mohamed Ben-daya - One of the best experts on this subject based on the ideXlab platform.
-
A Tabu search approach for the flow shop scheduling problem
European Journal of Operational Research, 1998Co-Authors: Mohamed Ben-daya, Mohammad A. Al-fawzanAbstract:In this paper, we propose a Tabu search approach for solving the permutation flow shop scheduling problem. The proposed implementation of the Tabu search approach suggests simple techniques for generating neighborhoods of a given sequence and a combined scheme for intensification and diversification that has not been considered before. These new features result in an implementation that improves upon previous Tabu search implementations that use mechanisms of comparable simplicity. Also, better results were obtained than those produced by a simulated annealing algorithm from the literature.
W.e.l. Spieß - One of the best experts on this subject based on the ideXlab platform.
-
Improving the structure of deep frozen and chilled food chain with Tabu search procedure
Journal of Food Engineering, 2003Co-Authors: Guimei Zhang, Walter Habenicht, W.e.l. SpießAbstract:This paper presents a Tabu search algorithm to optimize the structure of cold chains for distribution of chilled or frozen foods. The physical distribution system is structured in such a way that the cost for storage and transportation in the whole distribution system is minimized, while the product quality requirement is fulfilled. A dynamic Tabu list and penalty costs are used in the Tabu search procedure. Numerical results for test problems are reported.
Eric D Taillard - One of the best experts on this subject based on the ideXlab platform.
-
a Tabu search heuristic for the vehicle routing problem with soft time windows
Transportation Science, 1997Co-Authors: Eric D Taillard, Michel Gendreau, Philippe Badeau, Francois Guertin, Jeanyves PotvinAbstract:This paper describes a Tabu search heuristic for the vehicle routing problem with soft time windows. In this problem, lateness at customer locations is allowed although a penalty is incurred and added to the objective value. By adding large penalty values, the vehicle routing problem with hard time windows can be addressed as well. In the Tabu search, a neighborhood of the current solution is created through an exchange procedure that swaps sequences of consecutive customers (or segments) between two routes. The Tabu search also exploits an adaptive memory that contains the routes of the best previously visited solutions. New starting points for the Tabu search are produced through a combination of routes taken from different solutions found in this memory. Many best-known solutions are reported on classical test problems.
