In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a shared service. The problem consists of designing a set of minimum cost vehicle routes satisfying capacity, duration, time window, pairing, precedence and ride time constraints. This paper introduces a mixed-integer progr...

The two-echelon vehicle routing problem (2E-VRP) consists in making deliveries to a set of customers using two distinct fleets of vehicles. First-level vehicles pick up requests at a distribution center and bring them to intermediate sites. At these locations, the requests are transferred to second-level vehicles, which deliver them. This paper addresses a variant of the 2E-VRP that integrates ...

The performance of wireless mesh networks is highly depending on route selection under high traffic conditions. The traffic conditions will be varying at all time frames due to the conditions of wireless nodes, which affect the throughput of the network. There exist various approaches to handle the route selection under dynamic conditions but suffers with quality of service parameters. The chan...

Location-Routing Problem (LRP) emerges as one of the hybrid optimization problems in distribution networks in which, total cost of the system would be reduced significantly by simultaneous optimization of locating a set of facilities among candidate locations and routing vehicles. In this paper, a mixed integer linear programming model is presented for a two-echelon location-routing problem wit...

This paper investigates the routing, modulation, and spectrum assignment (RMSA) problem for advance reservation (AR) requests in semi-filterless optical networks (semi-FONs). A link resource-aware (LRA) algorithm consisting of three parts is proposed. First, request scheduling phase, a sorting strategy based on flexible window size starting time schedules AR with respect to time. Next, routing ...