A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
From MaRDI portal
Publication:1577763
DOI10.1016/S0377-2217(99)00380-XzbMath1025.90523MaRDI QIDQ1577763
Zihou Yang, Lixin Tang, Jiyin Liu, Aiying Rong
Publication date: 24 November 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
schedulinggenetic algorithmsiron and steel industrymultiple traveling salesman problemhot rolling production
Deterministic scheduling theory in operations research (90B35) Production models (90B30) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90)
Related Items
Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem, Hybrid search with neighborhood reduction for the multiple traveling salesman problem, An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem, Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach, A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM, Minimax persistent monitoring of a network system, A hybrid flowshop scheduling problem for a cold treating process in seamless steel tube production, A new approach to solving the multiple traveling salesperson problem using genetic algorithms, Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem, Production scheduling optimization algorithm for the hot rolling processes, Scheduling continuous aluminium casting lines, Lot sizing and furnace scheduling in small foundries, A multi-objective hot-rolling scheduling problem in the compact strip production, Scheduling in a continuous galvanizing line, A finite-capacity production scheduling procedure for a Belgian steel company, Modeling and application for rolling scheduling problem based on TSP, Integrated problem of soaking pit heating and hot rolling scheduling in steel plants, Development of hybrid evolutionary algorithms for production scheduling of hot strip mill, Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case, The multiagent planning problem, An efficient optimal solution to the coil sequencing problem in electro-galvanizing line, A review of planning and scheduling systems and methods for integrated steel production, Integer linear programming formulations of multiple salesman problems and its variations, A mathematical model and two-stage heuristic for hot rolling scheduling in compact strip production, Simultaneously scheduling multiple turns for steel color-coating production, New Imperialist Competitive Algorithm to solve the travelling salesman problem, A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
- The traveling salesman problem: An overview of exact and approximate algorithms
- A mixed integer programming model for scheduling orders in a steel mill
- Some Simple Applications of the Travelling Salesman Problem
- Steel production schedule generation
- Solution of a Large-Scale Traveling-Salesman Problem
