Transportation is one thing that very important and the highest cost in supply chain. One way to reduce these costs optimize vehicle routes. The Multiple Traveling Salesman Problem (MTSP) Capacitated Vehicle Routing (CVRP) are models have been extensively researched In its development based on actual events real world, some priorities must be visited first optimizing Several studies MTSP CVRP c...

In order to conquer the premature convergence problem and lower the cost of computing of the basic Ant Colony Algorithm (ACA), we present an adaptive ant colony algorithm, named AACA, coupled with a Pareto Local Search (PLS) algorithm and apply to the Vehicle Routing Problem (VRP) and Capacitated VRP (CVRP). By using the information entropy, the algorithm adjusts the pheromone updating strategy...

The Split Delivery Vehicle Routing Problem (SDVRP) is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) where customers may be assigned to multiple routes. A new construction heuristic is developed for the SDVRP and computational results are given for thirty-two data sets from previous literature. With respect to the total travel distance, the construction heuristic compares favora...

We propose an abstraction of emerging vehicle routing problems, the VRP with Black Box Feasibility. In this problem the routes of a basic VRP need to satisfy an unknown set of constraints. A black box function to test the feasibility of a route is provided. Practical examples of such problems are combinations of VRP with Loading or VRP with Scheduling. We propose a heuristic column generation-b...

This paper concerns the Split Delivery Vehicle Routing Problem (SDVRP). This problem is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) since the customers’ demands are allowed to be split. We deal with the cases where the fleet is unlimited (SDVRP-UF) and limited (SDVRP-LF). In order to solve them, we implemented a multi-start Iterated Local Search (ILS) based heuristic that inc...

This paper presents an artificial bee colony (ABC) algorithm adjusted for the capacitated vehicle routing problem. The vehicle routing problem is an NP-hard problem and capacitated vehicle routing problem variant (CVRP) is considered here. The artificial bee metaheuristic was successfully used mostly on continuous unconstrained and constrained problems. Here this algorithm has been implemented ...

This work presents the application of a CO2 emission estimation function for cargo vehicles on Capacited Vehicle Routing Problems (CVRP) setting, considering route’s slopes variation. Comparisons were established with functions minimizing fuel consumption and route length in case study about selective collection recyclable waste at Sorocaba, state São Paulo, Brazil. Routes lower emissions have ...

Objectives: to translate, adapt cross-culturally and validate into Brazilian Portuguese the following instrument: "Self-assessment of communication skills and professionalism in residents" for the nursing professional, and to determine if personal characteristics and performance of the nurse interfere in the self-assessment about professionalism and interpersonal communication. Method: quanti...