scholarly journals A Heuristic Solution Method of Mixed Problem of Materials' Cutting Plan Decision and Production Scheduling for Foundation Reinforcement Units Manufacturing

2021 ◽  
Vol 15 (1) ◽  
pp. 1-8
Author(s):  
Harumi Haraguhi ◽  
Nakanarusawa Hitachi
Keyword(s):  
Mixed Problem ◽  
Production Scheduling ◽  
Solution Method ◽  
Heuristic Solution ◽  
Cutting Plan

scholarly journals A Heuristic Solution Method for Multi-Depot Vehicle Routing-Based Waste Collection Problems

2020 ◽  
Vol 10 (7) ◽  
pp. 2403
Author(s):  
Yanjun Shi ◽  
Lingling Lv ◽  
Fanyi Hu ◽  
Qiaomei Han
Keyword(s):  
Vehicle Routing ◽  
Waste Disposal ◽  
Vehicle Routing Problem ◽  
Solution Method ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Waste Collection ◽  
Heuristic Solution ◽  
Routing Problem ◽  
Combination Optimization

This paper addresses waste collection problems in which urban household and solid waste are brought from waste collection points to waste disposal plants. The collection of waste from the collection points herein is modeled as a multi-depot vehicle routing problem (MDVRP), aiming at minimizing the total transportation distance. In this study, we propose a heuristic solution method to address this problem. In this method, we firstly assign waste collection points to waste disposal plants according to the nearest distance, then each plant solves the single-vehicle routing problem (VRP) respectively, assigning customers to vehicles and planning the order in which customers are visited by vehicles. In the latter step, we propose the sector combination optimization (SCO) algorithm to generate multiple initial solutions, and then these initial solutions are improved using the merge-head and drop-tail (MHDT) strategy. After a certain number of iterations, the optimal solution in the last generation is reported. Computational experiments on benchmark instances showed that the initial solutions obtained by the sector combination optimization algorithm were more abundant and better than other iterative algorithms using only one solution for initialization, and the solutions with distance gap were obtained using the merge-head and drop-tail strategy in a lower CPU time compared to the Tabu search algorithm.

Capacity Consumption Analysis Using Heuristic Solution Method for Under Construction Railway Routes

2014 ◽  
Vol 14 (3-4) ◽  
pp. 317-333 ◽  
Author(s):  
Masoud Yaghini ◽  
Mohammadreza Sarmadi ◽  
Nariman Nikoo ◽  
Mohsen Momeni
Keyword(s):  
Solution Method ◽  
Heuristic Solution ◽  
Under Construction

A heuristic solution method for disassemble-to-order problems with binomial disassembly yields

2017 ◽  
Vol 185 ◽  
pp. 266-274 ◽  
Author(s):  
Karl Inderfurth ◽  
Ian M. Langella ◽  
Sandra Transchel ◽  
Stephanie Vogelgesang
Keyword(s):  
Solution Method ◽  
Heuristic Solution

scholarly journals A heuristic solution method for node routing based solid waste collection problems

2011 ◽  
Vol 19 (2) ◽  
pp. 129-156 ◽  
Author(s):  
Vera Hemmelmayr ◽  
Karl F. Doerner ◽  
Richard F. Hartl ◽  
Stefan Rath
Keyword(s):  
Solid Waste ◽  
Solution Method ◽  
Waste Collection ◽  
Heuristic Solution ◽  
Solid Waste Collection ◽  
Node Routing

Pre-Marshalling Problem: Heuristic solution method and instances generator

2012 ◽  
Vol 39 (9) ◽  
pp. 8337-8349 ◽  
Author(s):  
Christopher Expósito-Izquierdo ◽  
Belén Melián-Batista ◽  
Marcos Moreno-Vega
Keyword(s):  
Solution Method ◽  
Heuristic Solution
Sign in / Sign up

Export Citation Format

Share Document