Neighborhood search algorithms with restricted infeasible solution sets–application to a transportation project evaluation problem

2005 ◽  
Vol 28 (3) ◽  
pp. 545-550
Author(s):  
Shangyao Yan ◽  
Rong‐Chang Jou ◽  
Chia‐Hung Chen ◽  
Chyi‐Feng Lee
Keyword(s):  
Project Evaluation ◽  
Search Algorithms ◽  
Neighborhood Search ◽  
Solution Sets ◽  
Evaluation Problem ◽  
Neighborhood Search Algorithms

scholarly journals Variable Neighborhood Search Algorithms for an Integrated Manufacturing and Batch Delivery Scheduling Minimizing Total Tardiness

2019 ◽  
Vol 9 (21) ◽  
pp. 4702
Author(s):  
Cheol Min Joo ◽  
Byung Soo Kim
Keyword(s):  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Search Algorithms ◽  
Mixed Integer ◽  
Neighborhood Search ◽  
Manufacturing Plant ◽  
Selection Probability ◽  
Case Selection ◽  
Neighborhood Search Algorithms ◽  
Neighborhood Search Algorithm

This article addresses an integrated problem of one batching and two scheduling decisions between a manufacturing plant and multi-delivery sites. In this problem, two scheduling problems and one batching problem must be simultaneously determined. In the manufacturing plant, jobs ordered by multiple customers are first manufactured by one of the machines in the plant. They are grouped to the same delivery place and delivered to the corresponding customers using a set of delivery trucks within a limited capacity. For the optimal solution, a mixed integer linear programming model is developed and two variable neighborhood search algorithms employing different probabilistic schemes. We tested the proposed algorithms to compare the performance and conclude that the variable neighborhood search algorithm with dynamic case selection probability finds better solutions in reasonable computing times compared with the variable neighborhood search algorithm with static case selection probability and genetic algorithms based on the test results.

Sign in / Sign up

Export Citation Format

Share Document