[go: up one dir, main page]

Van Hemert et al., 2004 - Google Patents

Dynamic routing problems with fruitful regions: Models and evolutionary computation

Van Hemert et al., 2004

View PDF
Document ID
10414811456092748085
Author
Van Hemert J
La Poutré J
Publication year
Publication venue
International conference on parallel problem solving from nature

External Links

Snippet

We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to maximise the number of loads transported, while keeping to capacity and time constraints. Loads arrive …
Continue reading at www.academia.edu (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G06Q10/0631—Resource planning, allocation or scheduling for a business operation
    • G06Q10/06316—Sequencing of tasks or work
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G06Q10/0639—Performance analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G06Q10/0637—Strategic management or analysis
    • G06Q10/06375—Prediction of business process outcome or impact based on a proposed change
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
    • G06Q10/047—Optimisation of routes, e.g. "travelling salesman problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/50—Network service management, i.e. ensuring proper service fulfillment according to an agreement or contract between two parties, e.g. between an IT-provider and a customer
    • H04L41/5041—Service implementation

Similar Documents

Publication Publication Date Title
Van Hemert et al. Dynamic routing problems with fruitful regions: Models and evolutionary computation
US7363126B1 (en) Core area territory planning for optimizing driver familiarity and route flexibility
Kadri et al. A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems
Cheung et al. Dynamic routing model and solution methods for fleet management with mobile technologies
Pang An adaptive parallel route construction heuristic for the vehicle routing problem with time windows constraints
Antevski et al. Resource orchestration of 5G transport networks for vertical industries
Ninikas et al. Reoptimization strategies for a dynamic vehicle routing problem with mixed backhauls
Khouadjia et al. Metaheuristics for dynamic vehicle routing
Bonilha et al. Ant colony optimization with heuristic repair for the dynamic vehicle routing problem
Sreelekshmi et al. Dynamic vehicle routing for solid waste management
González-Ramírez et al. A hybrid metaheuristic approach to optimize the districting design of a parcel company
Orozco et al. Reactive and proactive routing strategies with real-time traffic information
RUSS et al. Optimising the design of multimodal freight transport network in Indonesia
Holliday et al. Augmenting transit network design algorithms with deep learning
Grunert et al. The design of a letter-mail transportation network by intelligent techniques
Barbucha et al. Agent-based approach to the dynamic vehicle routing problem
van Hemert et al. REPORT SEN-E0410 AUGUST 2004
Wang et al. Demand-Responsive Transport Dynamic Scheduling Optimization Based on Multi-agent Reinforcement Learning Under Mixed Demand
van Hemert et al. Exploiting fruitful regions in dynamic routing using evolutionary computation
Barbucha et al. Multi-agent platform for solving the dynamic vehicle routing problem
Ramos et al. Solving heterogeneous fleet multiple depot vehicle scheduling problem as an asymmetric traveling salesman problem
Agrawal A machine-learning framework for a novel 3-step approach for real-time taxi dispatching
Rezaei et al. Gym-DC: a distribution centre reinforcement learning environment
Ferrucci Introduction to tour Planning: Vehicle routing and related problems
Li et al. Proximal Policy Optimization for Same-Day Delivery with Drones and Vehicles