This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...

Simplified Dolphin Echolocation (SDE) optimization is an improved version of the Dolphin Echolocation optimization. The dolphin echolocation (DE) is a recently proposed metaheuristic algorithm, which was imitated dolphin’s hunting process. The global or near global optimum solution modeled as dolphin’s bait, dolphins send sound in different directions to discover the best bait among their searc...

  The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...

This chapter deals with the application of evolutionary approaches and other metaheuristic techniques for generating tree decompositions. Tree decomposition is a concept introduced by Robertson and Seymour [34] and it is used to characterize the difficulty of constraint satisfaction and NP-hard problems that can be represented as a graph. Although in general no polynomial algorithms have been f...

Water is the main and most important human life requirement. for that, governmentsworkto feed population gatherings. So,it to take into care size of water tanksand pipes achievethe best reliabilityfor distribution systems.In global, network consumes 60 percent all cost distributionsystem. So this, we must get optimum construction as a function profit reliability save high amount money.In recent...

Cryptology is a thriving research area of great practical importance. It is a fundamental building block of communications security. Metaheuristic optimisation techniques such as simulated annealing and genetic algorithms have found successful application in a huge number of fields. However, their application to leading edge industrial-strength cryptology has been slight. The power of metaheuri...

In studies of genetic algorithms, evolutionary computing, and ant colony mechanisms, it is recognized that the higher-order forms of collective intelligence play an important role in metaheuristic computing and computational intelligence. Collective intelligence is an integration of collective behaviors of individuals in social groups or collective functions of components in computational intel...

Computational cost of metaheuristic based optimum design algorithms grows excessively with structure size. This results in computational inefficiency of modern metaheuristic algorithms in tackling optimum design problems of large scale structural systems. This paper attempts to provide a computationally efficient optimization tool for optimum design of large scale steel frame structures to AISC...

Using the Unconstrained Binary Quadratic Programming (UBQP) problem as a case study, we present an experimental analysis of neighborhood combinations for local search based metaheuristic algorithms. In this work, we use one-flip and two-flip moves and investigate combined neighborhoods with these two moves within two metaheuristic algorithms. The goal of the analysis is to help understand why a...