[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Doppstadt et al., 2020 - Google Patents

The hybrid electric vehicle—Traveling salesman problem with time windows

Doppstadt et al., 2020

View PDF
Document ID
1415973266899748665
Author
Doppstadt C
Koberstein A
Vigo D
Publication year
Publication venue
European Journal of Operational Research

External Links

Snippet

In this paper, we extend the Hybrid Electric Vehicle–Traveling Salesman Problem (HEV- TSP) that deploys hybrid electric vehicles for customer delivery tours, by considering that customers must be served within given time windows. This feature makes the problem very …
Continue reading at research.vu.nl (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/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"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • 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/10—Office automation, e.g. computer aided management of electronic mail or groupware; Time management, e.g. calendars, reminders, meetings or time accounting
    • 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
    • G06Q30/00—Commerce, e.g. shopping or e-commerce
    • G06Q30/02—Marketing, e.g. market research and analysis, surveying, promotions, advertising, buyer profiling, customer management or rewards; Price estimation or determination
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • 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
    • G06Q50/00—Systems or methods specially adapted for a specific business sector, e.g. utilities or tourism
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass

Similar Documents

Publication Publication Date Title
Doppstadt et al. The hybrid electric vehicle—Traveling salesman problem with time windows
Doppstadt et al. The hybrid electric vehicle–traveling salesman problem
Zhang et al. A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows
Dell’Amico et al. The bike sharing rebalancing problem with stochastic demands
Guimarães et al. The two-echelon multi-depot inventory-routing problem
Yang et al. Battery swap station location-routing problem with capacitated electric vehicles
Scheuerer A tabu search heuristic for the truck and trailer routing problem
Berbeglia et al. A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
Rahimi-Vahed et al. Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm
Ferreira et al. Two effective simulated annealing algorithms for the location-routing problem
Kachitvichyanukul et al. Two solution representations for solving multi-depot vehicle routing problem with multiple pickup and delivery requests via PSO
Jun et al. New best solutions to VRPSPD benchmark problems by a perturbation based algorithm
Huber et al. Order matters–a variable neighborhood search for the swap-body vehicle routing problem
Scholl et al. E-platooning: Optimizing platoon formation for long-haul transportation with electric commercial vehicles
Ulmer Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing
Euchi et al. A hybrid tabu search to solve the heterogeneous fixed fleet vehicle routing problem
Tang et al. A bilevel programming model and algorithm for the static bike repositioning problem
Bruglieri et al. A matheuristic for the electric vehicle routing problem with time windows and a realistic energy consumption model
Löffler et al. Routing electric vehicles with a single recharge per route
Lehmann et al. A matheuristic for the Two-Echelon Multi-Trip Vehicle Routing Problem with mixed pickup and delivery demand and time windows
Batsyn et al. Heuristic for a real-life truck and trailer routing problem
Zaidi et al. Electric vehicle charging scheduling problem: Heuristics and metaheuristic approaches
Rocha et al. Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows
Dan et al. Improved multi-agent system for the vehicle routing problem with time windows
Lian et al. The electric on-demand bus routing problem with partial charging and nonlinear function