The problem undertaken in this study is inspired from a real life application. Consider a vehicle routing problem where the distances between the customer locations are either one or two. We name this problem as VRP12 in an analogy for the name TSP12 used for the traveling salesman problem in...

This paper introduces a school bus scheduling problem wherein trips for each school are given. A trip consists of a sequence of bus stops and their designated school. Each school has its fixed time window within which trips should be completed. A school bus can serve multiple trips for multiple...

The use of non-iterative shortest route algorithm for finding shortest route between points in a network is illustrated. The non-iterative approach can be applied to various network problems that can be solved using shortest route algorithm and provides a solution with much less effort. The...

We report the solution to optimality of ten large-scale symmetric travelling salesman problems. The travelling salesman problem (TSP) is one of the standard problems of the Operations Research/Management Science literature and is cited in virtually every textbook on this subject. The TSP is a...

In this paper a one-machine scheduling model is analyzed where [TeX: $n$] different jobs are classified into [TeX: $K$] groups depending on which additional resource they require. The change-over time from one job to another consists of the removal time or of the set-up time of the two jobs. It...

The travelling salesman problem (TSP) is one of the most prominent NP-hard combinatorial optimisation problems. After over fifty years of intense study, the TSP continues to be of broad theoretical and practical interest. Using a novel approach to empirical scaling analysis, which in principle...

The adjustable parameters of probability distributions adopted by extremal optimization (EO) and its modified versions play a critical role in controlling their performances. Unlike the traditional static probability distribution based strategy, this paper presents a novel method called...

Background: The Travelling Salesman Problem is an NP-hard problem in combinatorial optimization with a number of practical implications. There are many heuristic algorithms and exact methods for solving the problem. Objectives: In this paper we study the influence of hybridization of a genetic...