ABSTRACT: Travelling salesman problem (TSP) is a routing problem, which is a sub-problem of many application domains such as transportation, network communication. In this paper, we propose a novel methodology which solves the problem ACO algorithm has defined with well distribution strategy in which total search space area is partition into P numbers of hyper-cubic quadrants where P is the dim...

This paper studies the multi-depot joint distribution vehicle routing problem considering energy consumption with time-dependent networks (MDJDVRP-TDN). Aiming at where travel time depends on variation characteristics of road network speed in area, influence and relationship between load fuel consumption, a optimization model is established to minimize sum fixed cost, cost window penalty cost. ...

QoS multicast routing is a non-linear combinatorial optimization problem that arises in many multimedia applications. Providing QoS support is crucial to guarantee effective transportation of multimedia service in multicast communication. Computing the band-widthdelay constrained least cost multicast routing tree is an NP-complete problem. In this paper, a novel heuristic QoS multicast routing ...

The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...

This study will solve the classical vehicle routing problem, goal is to generate k trips with shortest distance for h customers predetermined locations and needs.. The proposed solution problem a hybrid sine cosine algorithm. algorithm hybridized grey wolf optimizer, which used in combination methods of tournament selection, opposition learning, mutation crossover method build optimal plan mean...

This paper presents a system proposing a solution to the problem of Origin-Destination (OD) trip modelling for Multimodal Transportation Networks (MTN) using GIS tools. An efficient method for the handling of travel information within the MTN consists of dealing with an optimal multimodal routing of travellers from a point of origin to point of destination. Furthermore, the multimodal travellin...

This paper addresses the capacitated vehicle routing problem with twodimensional loading constraints (2L-CVRP). The 2L-CVRP is a combination of the two most important problems in distribution logistics, which are loading of freight into vehicles, and the successive routing of the vehicles to satisfy customer demand. The objective is to minimize the transportation cost. All vehicles must start a...

This study presents a multimodal hub location problem which has the capability to split commodities by limited-capacity hubs and transportation systems, based on the assumption that demands are stochastic for multi-commodity network flows. In the real world cases, demands are random over the planning horizon and those which are partially fulfilled, are lost. Thus, the present study handles dema...

This paper proposes a model for obnoxious waste location-routing problem (LRP) considering various types of wastes and several treatment technologies. The investigated distribution network includes three echelons of generation nodes, treatment and disposal facilities. A multi-objective LRP model is developed with three objective functions minimizing the treatment and disposal facility undesirab...

The coordination of just-in-time production and transportation in a network of partially independent facilities to guarantee timely delivery to distributed customers is one of the most challenging aspect of supply chain management. From a theoretical perspective, the timely production/distribution can be viewed as a hybrid combination of planning, scheduling and routing problem, each notoriousl...