Recent years have witnessed the use of metaheuristic algorithms to solve the optimization
problems that usually require extensive computations and time. Among others, scatter …

Over the last decades, network design problems (NDPs) have been one of the most
investigated combinatorial optimisation problems that are still catching the interest of both …

In parallel with the growth of both domestic and international economies, there have been
substantial efforts in making manufacturing and service industries more environmental …

This paper proposes an optimisation model and a meta-heuristic algorithm for solving the
urban network design problem. The problem consists in optimising the layout of an urban …

Abstract GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart
metaheuristic for producing good-quality solutions of combinatorial optimization problems …

Network Design Problem (NDP) is one of the important problems in combinatorial
optimization. Among the network design problems, the Multicommodity Network Design …

In this paper, we propose a capacity scaling heuristic using a column generation and row
generation technique to address the multicommodity capacitated network design problem …

This paper presents an evolutionary algorithm for the fixed-charge multicommodity network
design problem (MCNDP), which concerns routing multiple commodities from origins to …

The capacitated multicommodity network design problem represents a network design
system and has a wide range of real-life applications, such as the construction of logistics …

This paper studies a version of the fixed-charge multicommodity network design problem
where in addition to the traditional costs of flow and design, congestion at nodes is explicitly …