In this study, a temperature parallel simulated annealing with adaptive neighborhood (TPSA/AN) for continuous optimization problems is introduced. TPSA/AN is based on the temperature parallel simulated annealing (TPSA), which is suitable for parallel processing, and the SA that Corana developed for continuous optimization problems. The moves in TPSA/AN are adjusted to have equal acceptance rate...

In this paper, a Temperature Parallel Simulated Annealing with Adaptive Neighborhood (TPSA/AN) for continuous optimization problems is introduced. TPSA/AN is based on the temperature parallel simulated annealing (TPSA), which is suitable for parallel processing, and the SA that Corana developed for continuous optimization problems. The moves in TPSA/AN are adjusted to have equal acceptance rate...

The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics, which is an extension of well known Vehicle Routing Problem (VRP), with a central depot. The Objective is to design an optimal set of routes for serving a number of customers without violating the customer’s time window constraints and vehicle capacity constraint. It has received considerable attention i...

Many problem-specific heuristic frameworks have been developed to solve combinatorial optimization problems, but these do not generalize well other problem domains. Metaheuristic aim be more generalizable compared traditional heuristics, however their performances suffer from poor selection of low-level heuristics (operators) during the search process. An example in a metaheuristic framework is...

Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the Encyclopedia of Optimization.

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

This paper studies the time-dependent vehicle routing problem with private fleet and common carriers (TDVRPPC), which provides an option to outsource customer requests considers real-world travel times. The is commonly seen in transportation logistics industries as it impact of changing traffic conditions on times, maximum working hour regulations well capacity constraints. time modeled a piece...

We study the planning of a multi-modal transportation system with perishable products, demand uncertainty and repositioning empty Returnable Transport Items (RTIs). propose rolling horizon framework where we periodically re-optimize. As such, relevant responses actions to new occurred are taken, possible updates plans can be made. Our considers customer demand, formulated as Scenario-based Two-...

Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu search, most of these heuristics are memoryless. In this paper we introduce a new neighborhood search heuristic that makes effective use of memory structures in a way that is different from tabu search. We re...