Pages that link to "Item:Q1577763"
From MaRDI portal
The following pages link to A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex (Q1577763):
Displaying 29 items.
- A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms (Q257224) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- Scheduling in a continuous galvanizing line (Q947966) (← links)
- An efficient optimal solution to the coil sequencing problem in electro-galvanizing line (Q976044) (← links)
- Simultaneously scheduling multiple turns for steel color-coating production (Q1042046) (← links)
- Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem (Q1666220) (← links)
- Development of hybrid evolutionary algorithms for production scheduling of hot strip mill (Q1761983) (← links)
- A multi-objective hot-rolling scheduling problem in the compact strip production (Q1984951) (← links)
- Integrated problem of soaking pit heating and hot rolling scheduling in steel plants (Q2003439) (← links)
- Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case (Q2005780) (← links)
- The multiagent planning problem (Q2012788) (← links)
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem (Q2146986) (← links)
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem (Q2147041) (← links)
- Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem (Q2214785) (← links)
- Modeling and application for rolling scheduling problem based on TSP (Q2243302) (← links)
- A mathematical model and two-stage heuristic for hot rolling scheduling in compact strip production (Q2293881) (← links)
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms (Q2432849) (← links)
- Lot sizing and furnace scheduling in small foundries (Q2456652) (← links)
- Integer linear programming formulations of multiple salesman problems and its variations (Q2503218) (← links)
- Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach (Q2668611) (← links)
- Minimax persistent monitoring of a network system (Q2681352) (← links)
- New Imperialist Competitive Algorithm to solve the travelling salesman problem (Q2855772) (← links)
- A hybrid flowshop scheduling problem for a cold treating process in seamless steel tube production (Q2967577) (← links)
- A finite-capacity production scheduling procedure for a Belgian steel company (Q3012635) (← links)
- A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM (Q3502949) (← links)
- Production scheduling optimization algorithm for the hot rolling processes (Q3533181) (← links)
- Scheduling continuous aluminium casting lines (Q3541174) (← links)
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)
- A review of planning and scheduling systems and methods for integrated steel production (Q5943554) (← links)
