... Abstract. Nowadays, smart cities management has become an important topic where algorithms are crucial to solving their problems. Some topics related to smart cities can be modeled as combinatorial optimization problems. ...
... the problem of distribution (goods and services), being also of great importance within the supply ...the CapacitatedVehicleRoutingProblem with ellipsoidal distances, which includes ...
... Salesman Problem is ...the CapacitatedVehicleRoutingProblem is solved including our metaheuristic in a Multi-Start Variable Neighborhood Descent ...This problem is focused on ...
... Éste documento presenta la solución a un caso logístico, un problema de programación de vehículos con restriccines de capacidad CVRP (The capacitatedvehicleroutingproblem). Éste caso es ...
... (CapacitatedVehicleRoutingProblem, CVRP) consiste en minimizar el costo total de repartir una demanda determinística a cada cliente con una flota de vehículos idénticos, los que tienen una ...
... Salesman Problem (TSP), given a set of customers, and known costs between each pair of customers, the TSP is the problem of finding a tour, originating and terminating at a central deposit, which visits ...
... Tarantilis and Kiranoudis (2007) proposed their method for a variant of the VehicleRoutingProblem with a Heterogeneous Fixed Fleet. The objective is to minimize a combination of fixed ...
... The VehicleRoutingProblem (VRP) deals with the assignment of a set of transportation orders to a fleet of vehicles, and the sequencing of stops for each vehicle to minimize transportation ...
... The RoutingProblem with Profits, also called Orienteering Problem (OP) considers a set of nodes (customers), each with an associated profit, and a set of arcs, each with associated travel ...
... distributions. It is assumed that the demand of the customer does not exceed the vehicle capa- city and it has a discrete probability distribution . The random variables are independents. The objective of the ...
... the problem, including the following: a successive approximation method that reduces the FSMVRPB to iteratively solving a series of homogeneous VRPB, a biased-randomized metaheuristic algorithm for solving the ...
... HHC problem as a full-sized weekly model, which task is to create a service plan with nurses and patients such that the patients are served with the provided ...schedule problem (MSP) addresses the task to ...
... The number of farms used for this test is going to be the first 50, as we consider it a representative size for the problem at hand. Because of the random nature of the algorithm, we will test 5 runs over all ...
... The growing flows of freight have been a fundamental component of contemporary changes in economic systems at the global, regional and local scales. Road transporta- tion is nowadays the predominant way of transporting ...
... and routingproblem(OBRP) regarding heterogeneous vehicleroutingproblem (HVRP), in order to identify whether there are any differences and similarities between these ...the ...
... Path Problem (GESPP) is studied in this ...The problem is to compute the minimum cost path from a given source node to the sink node in a ...bus routing, pricing problems, public transportation or ...
... location routing and inventory problem, as mentioned before, is to choose depots from multiple possible ORFDWLRQV WR VFKHGXOH YHKLFOHV¶ URXWHV WR PHHW FXVWRPHU¶V demands and to determine the inventory ...
... p-median problem caused advances in solution techniques to be often made using combinations of mathematical programming and heuristic search techniques such as branch and bound and Lagrangian relaxation ...and ...
... We consider that an operation center (OC) coordinates both the transport service and the scheduling of recharge. The transport service consists in an EV fleet that provides a shuttle airport-hotel (SA), which implies to ...