We consider the multi-vehicle one-to-one pickup and delivery problem with split loads, a NP-hard problem linked with a variety of applications for bulk product transportation, bike-sharing systems and inventory re-balancing. This problem is notoriously difficult due to the interaction of two challenging vehicle routing attributes, “pickups and deliveries” and “split deliveries”. This possibly l...

Flowshop scheduling is a very active research area. This problem still attracts a considerable amount of interest despite the sheer amount of available results. Total flowtime minimization of a flowshop has been actively studied and many effective algorithms have been proposed in the last few years. New best solutions have been found for common benchmarks at a rapid pace. However, these improve...

This paper solves the dynamic traveling salesman problem (DTSP) using dynamic Gaussian Process Regression (DGPR) method. The problem of varying correlation tour is alleviated by the nonstationary covariance function interleaved with DGPR to generate a predictive distribution for DTSP tour. This approach is conjoined with Nearest Neighbor (NN) method and the iterated local search to track dynami...

In this paper the performance of the Cultural Algorithms-Iterated Local Search (CA-ILS), a new continuous optimization algorithm, is empirically studied on multimodal test functions proposed in the Special Session on Real-Parameter Optimization of the 2005 Congress on Evolutionary Computation. It is compared with state-of-the-art methods attending the Session to find out whether the algorithm i...

This paper deals with the Unrelated Parallel Machine Scheduling Problem with Setup Times (UPMSPST). The objective is to minimize the maximum completion time of the schedule, the so-called makespan. This problem is commonly found in industrial processes like textile manufacturing and it belongs to N P -Hard class. It is proposed an algorithm named AIV based on Iterated Local Search (ILS) and Var...

Combinatorial optimization has been a workhorse of financial and risk management, and it has spawned a large number of real-life applications. Prominent in this body of research is the mean-variance efficient frontier (MVEF) that emanates from the portfolio optimization problem (POP), pioneered by Harry Markowitz. A textbook version of POP minimizes risk for a given expected return on a portfol...

This study presents an investigation of enhancing the capability of the Scatter Search (SS) metaheuristic in guiding the search effectively toward elite solutions. Generally, SS generates a population of random initial solutions and systematically selects a set of diverse and elite solutions as a reference set for guiding the search. The work focuses on three strategies that may have an impact ...

A great deal of research has been focused on solving the job-shop problem (ΠJ), over the last forty years, resulting in a wide variety of approaches. Recently, much effort has been concentrated on hybrid methods to solve ΠJ as a single technique cannot solve this stubborn problem. As a result much effort has recently been concentrated on techniques that combine myopic problem specific methods a...