The Pollution-Routing Problem (PRP) is a recently introduced extension of the classical Vehicle Routing Problem with Time Windows which consists of routing a number of vehicles to serve a set of customers, and determining their speed on each route segment so as to minimize a function comprising...

Purpose – The purpose of this paper is to solve the maintenance management problems of generating units under the reliability criterion. Design/methodology/approach – The problem has been formulated as a combinatorial optimization task, with explicit and simultaneous treatment of multiple...

Scheduling track lines at a marshalling station where the objective is to determine the maximal weighted number of trains on the track lines can be modeled as an interval scheduling problem: each job has a fixed starting and finishing time and can only be carried out by an arbitrarily given...

Community structure is an important property of complex networks. How to detect the communities is significant for understanding the network structure and to analyze the network properties. Many algorithms, such as K–L and GN, have been proposed to detect community structures in complex...

We present a new approximation algorithm for the two-dimensional bin-packing problem. The algorithm is based on two one-dimensional bin-packing algorithms. Since the algorithm is of next-fit type it can also be used for those cases where the output is required to be on-line (e. g. if we open an...

We present a new approximation algorithm for the two-dimensional bin-packing problem. The algorithm is based on two one-dimensional bin-packing algorithms. Since the algorithm is of next-fit type it can also be used for those cases where the output is required to be on-line (e. g. if we open an...