This paper aimed to develop a delivery truck scheduling management system using decision tree support decision-making in selecting truck. First-in-first-out (FIFO) and techniques were applied prioritize loading doors for trucks with the use of iterated local search (ILS) recommending route transport goods. Besides, an arrangement can be assigned door that meets specified conditions. The experim...

Two hyperheuristics are proposed as entries for the 2011 Cross-domain Heuristic Search Challenge (CHeSC), namely DynamicILS and BiasILS; both are simple adaptations of Iterated Local Search (ILS). 1 Iterated Local Search Iterated Local Search (ILS) [3] is a metaheuristic search technique which aims to find good solutions to difficult combinatorial optimisation problems in a reasonable amount of...

The Heterogeneous Fleet Vehicle Routing Problem (HFVRP) is an important variant of the classical Capacitated (CVRP) that aims to find routes minimize total traveling cost a heterogeneous fleet vehicles. This problem great interest given its importance in many industrial and commercial applications. In this paper, we present Adaptive Iterated Local Search (AILS) heuristic for HFVRP. AILS local s...

The permutation flowshop scheduling problem is a widely studied combinatorial optimization with several real-world applications. In this paper we address green variant of the controllable processing times and two objective functions: one related to service level factory (makespan) another total cost or energy/carbon consumption. For propose novel Critical-Path based Iterated Local Search. This ...

Abstract In this paper, we solve the well-known symbolic regression problem that has been intensively studied and a wide range of applications. To it, propose an efficient metaheuristic-based approach, called RILS - ROLS . is based on following two elements: ( i ) iterated local search, which method backbone, mainly solving combinatorial some continuous aspects problem; ii ordinary least square...

The solution space of the travelling salesman problem under 2-opt moves has been characterized as having a big-valley structure, in which the evaluation of a tour is positively correlated to the distance of the tour from the global optimum. We examine the big-valley hypothesis more closely and show that while the big-valley structure does appear in much of the solution space, it breaks down aro...