Optimal Solution of Vehicle Routing Problems with Fractional Objective Function

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solution of Fractional Optimal Control Problems with Noise Function Using the Bernstein Functions

This paper presents a numerical solution of a class of fractional optimal control problems (FOCPs) in a bounded domain having a noise function by the spectral Ritz method‎. ‎The Bernstein polynomials with the fractional operational matrix are applied to approximate the unknown functions‎. ‎By substituting these estimated functions into the cost functional‎, ‎an unconstrained nonlinear optimizat...

متن کامل

Parallel Solution Methods for Vehicle Routing Problems

Parallel solution methods contribute to efficiently address large and complex combinatorial optimization problems, vehicle routing problems in particular. Parallel exact and heuristic methods for VRP variants are increasingly being proposed and the pace seem to increase in recent years. “New” strategies have been proposed and many of the best known solutions to classical formulations have been ...

متن کامل

STOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES

The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...

متن کامل

Solution of Time Constrained Vehicle Routing Problems using Multi-Objective Hybrid Genetic Algorithm

Vehicle Routing Problem with Time windows (VRPTW) is an example of scheduling in constrained environment. It is a well known NP hard combinatorial scheduling optimization problem in which minimum number of routes have to be determined to serve all the customers within their specified time windows. So far different analytic and heuristic approaches have been tried to solve such problems. In this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transportation Science

سال: 2020

ISSN: 0041-1655,1526-5447

DOI: 10.1287/trsc.2019.0929