Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
A heuristic and lower bound for a multi-depot routing problem
Computers and Operations Research
Heuristic approaches to vehicle routing with backhauls and time windows
Computers and Operations Research
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Transportation Science
Computers and Operations Research
Parallel simulated annealing for the vehicle routing problem with time windows
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
A comparative study of population-based optimization algorithms for turning operations
Information Sciences: an International Journal
A heuristic to solve the synchronized log-truck scheduling problem
Computers and Operations Research
Hi-index | 0.07 |
The log truck scheduling problem under capacity constraints and time window constraints is an NP-hard problem that involves the design of best possible routes for a set of trucks serving multiple loggers and mills. The objective is to minimize the total unloaded miles traveled by the trucks. In this paper, a simulated annealing - a meta-heuristic optimization method - that interacts with a deterministic simulation model of the log transport system, in which the precedence and temporal relations among activities are explicitly accounted for, is proposed. The results obtained by solving a small size problem consisting of four trucks, two mills, three loggers, and four truck trips showed that the best solution could be found in less than two minutes. In addition, the solution method is tested using data provided by a log delivery trucking firm located in Mississippi. The firm operates sixty-eight trucks to deliver loads from twenty-two logging operations to thirteen mill destinations. The routes assigned by a supervisory person are used as a benchmark to compare the manual generated solution to the solution obtained using the proposed method.