Initially I was concerned with offline two-dimensional bin packing with one-dimensional vehicle routing. The problem is defined by a set of items, each having a height, a width and a destination distance within (0,1]. The destinations are aligned on the same road, along with the depot (starting point) on one side. The goal is to pack items into vehicles of 1 × 1 loading space, drive the vehicle...

This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...

This paper studies approximations to the average length of Vehicle Routing Problems (VRP) with time window, route duration, and capacity constraints. The approximations are valuable for the strategic and planning analysis of transportation and logistics problems. Using asymptotic properties of vehicle routing problems and the average probability of successfully sequencing a customer with time w...

Last-mile routing refers to the final step in a supply chain, delivering packages from depot station homes of customers. At level single van driver, task is traveling salesman problem. But choice route may be constrained by warehouse sorting operations, van-loading processes, driver preferences, and other considerations rather than straightforward minimization tour length. We propose simple eff...

The single-vehicle cyclic inventory routing problem (SV-CIRP) is concerned with a repeated distribution of a product from a single depot to a selected subset of retailers having stable demands. The objective is to determine the subset of retailers to cyclically replenish, the quantities to be delivered to each, and to design the vehicle routes so that the expected total distribution and invento...

In this paper, the fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery (FMDVRP-SPD) is investigated. The FMDVRP-SPD is the problem of allocating customers to several depots, so that the optimal set of routes is determined simultaneously to serve the pickup and the delivery demands of each customer within scattered depots. In the problem, both pickup and delivery dema...

The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem where a fleet of delivery vehicles must service known customer demands from a common depot at a minimum transit cost without exceeding the capacity constraint of each vehicle. In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. The algorithm uses a combinatio...

The classical vehicle routing problem (VRP) can be extended by including customers who want to send goods to the depot. This type of VRP is called the vehicle routing problem with pickups and deliveries (VRPPD). This study proposes a novel way to solve VRPPD by introducing a two-phase heuristic routing algorithm which consists of a clustering phase and uses the geometrical center of a cluster a...

We introduce the Synchronized Multi-Assignment Orienteering Problem (SMOP), a vehicle routing problem that requires jointly selecting set of jobs while synchronizing assignment and transportation agents to roles form ad-hoc teams at different job locations. Agents must be assigned only for which they are qualified. Each certain number in each role within time window contributes reward score if ...

This paper considers a special vehicle routing problem, the two-echelon problem with simultaneous delivery and pickup demands (2E-VRPSDP). The 2EVRPSDP differs from classic transportation problems in two ways. First, freight depot to customers is managed by shipping through intermediate satellites. Second, each customer 2E-VRPSDP may have demands. an extension of (2E-VRP) (VRPSDP). A variable n...