Research Article
Optimization of a Two-Echelon Location Lot-Sizing Routing Problem with Deterministic Demand
Algorithm 5
The local search procedure.
| Procedure: LocalSearch | | Input: A solution | | Output: | | ; ; | | neighborhood generated using CloseDepot | | move | | neighborhood generated using | | RouteExchange move | | neighborhood generated using RouteTrans | | move | | | if () then | | | else | | | end if | | neighborhood generated using | | CustExchange move | | neighborhood generated using CustTrans | | move | | neighborhood generated using CustRev | | move | | | if then | | | else | | | end if | | Return and |
|
