Iterated local search
View article
Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem Open
Distributed permutation flowshop scheduling problem (DPFSP) has become a very active research area in recent years. However, minimizing total flowtime in DPFSP, a very relevant and meaningful objective for today's dynamic manufacturing env…
View article
A Heuristic Distributed Task Allocation Method for Multivehicle Multitask Problems and Its Application to Search and Rescue Scenario Open
Using distributed task allocation methods for cooperating multivehicle systems is becoming increasingly attractive. However, most effort is placed on various specific experimental work and little has been done to systematically analyze the…
View article
The Electric Vehicle Routing Problem with Capacitated Charging Stations Open
Electric vehicle routing problems (E-VRPs) deal with routing a fleet of electric vehicles (EVs) to serve a set of customers while minimizing an operational criterion, for example, cost or time. The feasibility of the routes is constrained …
View article
The collaborative consistent vehicle routing problem with workload balance Open
The rising competition in the logistics sector forces companies to be more economically efficient. One of the major sources of inefficiency is the incomplete usage of available resources, such as vehicles’ capacities. Mechanism that allow …
View article
Optimizing e-commerce last-mile vehicle routing and scheduling under uncertain customer presence Open
The recent increase in online orders in e-commerce leads to logistical challenges such as low hit rates (proportion of successful deliveries). We consider last-mile vehicle routing and scheduling problems in which customer presence probabi…
View article
A Fast and Scalable Heuristic for the Solution of Large-Scale Capacitated Vehicle Routing Problems Open
In this paper, we propose a fast and scalable, yet effective, metaheuristic called FILO to solve large-scale instances of the Capacitated Vehicle Routing Problem. Our approach consists of a main iterative part, based on the Iterated Local …
View article
Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem Open
This paper addresses to the flowshop scheduling problem with blocking constraints. The objective is to minimize the makespan criterion. We propose a hybrid combinatorial particle swarm optimization algorithm (HCPSO) as a resolution techniq…
View article
A hybrid adaptive Iterated Local Search with diversification control to\n the Capacitated Vehicle Routing Problem Open
Metaheuristics are widely employed to solve hard optimization problems, like\nvehicle routing problems (VRP), for which exact solution methods are\nimpractical. In particular, local search-based metaheuristics have been\nsuccessfully appli…
View article
Solving the Agile Earth Observation Satellite Scheduling Problem With Time-Dependent Transition Times Open
The scheduling of agile Earth observation satellites is to select a subset of candidate targets each associated with a profit during their visible time windows in order to maximize the collected profits, under some operational constraints.…
View article
Local search metaheuristics for the critical node problem Open
We present two metaheuristics for the Critical Node Problem, that is, the maximal fragmentation of a graph through the deletion of nodes. The two metaheuristics are based on the Iterated Local Search and Variable Neighborhood Search framew…
View article
Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility Open
The multiperiod vehicle routing problem (MPVRP) is an extension of the vehicle routing problem in which customer demands have to be delivered in one of several consecutive time periods, for example, the days of a week. We introduce and exp…
View article
Breakout local search for the multi-objective gate allocation problem Open
The problem of assigning gates to arriving and departing flights is one of the most important problems in airport operations. We take into account the real multi-criteria nature of the problem by optimizing a total of nine gate allocation …
View article
A Travelling Salesman Problem With Carbon Emission Reduction in the Last Mile Delivery Open
The development of e-commerce has led to a surge in the number of online shopping parcels. However, given the lack of scale effect, last mile delivery is inefficient, expensive, and produces a considerable amount of carbon emissions, which…
View article
An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems Open
The mixed no-wait flowshop problem with both wait and no-wait constraints has many potential real-life applications. The problem can be regarded as a generalization of the traditional permutation flowshop and the no-wait flowshop. In this …
View article
Multi-objective multi-unit process plan generation in a reconfigurable manufacturing environment: a comparative study of three hybrid metaheuristics Open
Low costs, high reactivity and high quality products are necessary criteria for industries to achieve competitiveness in nowadays market. In this context, reconfigurable manufacturing systems (RMSs) have emerged to fulfil these requirement…
View article
Solving Permutation Flow Shop Scheduling Problem with Sequence-Independent Setup Time Open
In this paper, we study the resolution of a permutation flow shop problem with sequence-independent setup time. The objective is to minimize the maximum of job completion time, also called the makespan. In this contribution, we propose thr…
View article
The applications of multiple route optimization heuristics and meta-heuristic algorithms to solid waste transportation: A case study in Turkey Open
The dense population and high solid waste production make it challenging to determine the optimal routes for garbage collection trucks in metropolitan cities. Moreover, incorrectly planned routes cause waste of fuel, time, and other resour…
View article
A simheuristic algorithm for the capacitated location routing problem with stochastic demands Open
This is an Accepted Manuscript of an article published by Taylor & Francis in Journal of Simulation on 30 Oct 2019, available online: http://www.tandfonline.com/10.1080/17477778.2019.1680262
View article
A matheuristic for a multimodal long haul routing problem Open
We address a planning problem faced by logistics service providers who transport freight over long distances. Given a set of transportation requests, where the origin and the destination of each request are located far apart from each othe…
View article
Learning ensembles of priority rules for online scheduling by hybrid evolutionary algorithms Open
This paper studies the computation of ensembles of priority rules for the One Machine Scheduling Problem with variable capacity and total tardiness minimization. Concretely, we address the problem of building optimal ensembles of priority …
View article
Local Search Analysis for a Vehicle Routing Problem with Synchronization and Time Windows Constraints in Home Health Care Services Open
This paper presents the vehicle routing problem with time windows and synchronization constraints (VRPTWSyn) in the context of home health care services. We propose a new approach for solving the considered problem. To build an initial sol…
View article
Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic Open
This article finds feasible solutions to the travelling salesman problem, obtaining the route with the shortest distance to visit n cities just once, returning to the starting city. The problem addressed is clustering the cities, then usin…
View article
An iterative matheuristic for the inventory routing problem Open
The paper considers the inventory routing problem with the Maximum Level replenishment policy. Here, the supplier is in charge of replenishing goods to a number of customers and can decide when, and in what order, these customers should be…
View article
Iterated local search for workforce scheduling and routing problems Open
The integration of scheduling workers to perform tasks with the traditional vehicle routing problem gives rise to the workforce scheduling and routing problems (WSRP). In the WSRP, a number of service technicians with different skills, and…
View article
An iterated local search algorithm for the team orienteering problem with variable profits Open
The orienteering problem (OP) is a routing problem that has numerous applications in various domains such as logistics and tourism. The objective is to determine a subset of vertices to visit for a vehicle so that the total collected score…
View article
An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem Open
We study the mixed capacitated general routing problem (MCGRP) in which a fleet of capacitated vehicles has to serve a set of requests by traversing a mixed weighted graph. The requests may be located on nodes, edges, and arcs. The problem…
View article
An effective iterated greedy algorithm for blocking hybrid flow shop problem with due date window Open
Nowadays many industry consider an interval time as a due date instead of precise points in time. In this study, the hybrid flow shop scheduling problem with basic blocking constraint is tackled. Where jobs, if done within a due window, ar…
View article
An iterated local search for customer order scheduling in additive manufacturing Open
This paper studies the customer order scheduling problem in the context of additive manufacturing. The study discusses an integrated problem involving the nesting of parts as well as the scheduling of batches of nested parts onto unrelated…
View article
Iterated local search for the capacitated vehicle routing problem with sequence‐based pallet loading and axle weight constraints Open
In this article an Iterated Local Search algorithm for the capacitated vehicle routing problem with sequence‐based pallet loading and axle weight constraints is presented. Axle weight limits impose a great challenge for transportation comp…
View article
Exact and Heuristic Algorithms for the Carrier–Vehicle Traveling Salesman Problem Open
This paper presents new structural properties for the carrier–vehicle traveling salesman problem. The authors provide a new mixed-integer second-order conic optimization formulation, with associated optimality cuts based on the structural …