IEEE Transactions on Intelligent Transportation Systems,
Journal Year:
2022,
Volume and Issue:
23(9), P. 16330 - 16341
Published: Feb. 14, 2022
Considering
the
penetration
of
numerous
electric
vehicles
(EV)
into
transportation
sector,
EV
routing
problem
that
jointly
optimizes
charging
and
process
EVs
is
becoming
increasingly
popular,
which
should
be
solved
in
online
fashion
for
practical
requirements.
First,
we
start
with
an
offline
(EVRP)
a
large-scale
mixed
integer
nonlinear
program
(MINLP).
NP
hardness
MINLP,
solving
EVRP
directly
time-consuming
task
not
suitable
setting.
Hence,
Benders
decomposition
based
method
proposed
to
decompose
master
set
sub-problems
allows
distributed
implementation.
To
further
speed
up
computation,
relax
one
can
equivalently
as
linear
program.
Moreover,
novel
kind
valid
cut
added
relaxed
reduce
number
iterations.
In
order
adapt
setting,
by
introducing
virtual
depot,
utilize
rolling-horizon
framework
tackle
uncertainty
future
information,
where
real-time
repeatedly.
Finally,
simulations
using
real
road
map
Belgium
are
performed.
Besides,
numerical
results
validate
computation
algorithm
faster
than
state-of-the-art
algorithms
several
orders
magnitude,
showcase
capability
solve
large
size
instances
350
nodes
35
within
100
seconds.
Mathematics,
Journal Year:
2022,
Volume and Issue:
10(17), P. 3108 - 3108
Published: Aug. 29, 2022
This
paper
addresses
the
Electric
Vehicle
Routing
Problem
with
Simultaneous
Pickup
and
Delivery
(EVRP-SPD),
in
which
electric
vehicles
(EVs)
simultaneously
deliver
goods
to
pick
up
from
customers.
Due
limited
battery
capacity
of
EVs,
their
range
is
shorter
than
that
internal
combustion
vehicles.
In
EVRP,
addition
depot
customers,
there
are
also
charging
stations
(CS)
because
EVs
need
be
charged
when
empty.
The
problem
formulated
as
an
integer
linear
model,
efficient
solution
proposed
minimize
total
distance
traveled.
To
create
a
feasible
initial
solution,
Clarke
Wright’s
savings
algorithm
used.
Several
variants
variable
neighborhood
search
tested,
reduced-variable
used
find
best
reasonable
time.
Computer
experiments
performed
benchmark
instances
evaluate
effectiveness
our
approach
terms
quality
obtained
results
show
method
can
achieve
solutions
time
all
instances.
Energies,
Journal Year:
2021,
Volume and Issue:
14(16), P. 5131 - 5131
Published: Aug. 19, 2021
The
increasing
use
of
electric
vehicles
in
road
and
air
transportation,
especially
last-mile
delivery
city
mobility,
raises
new
operational
challenges
due
to
the
limited
capacity
batteries.
These
limitations
impose
additional
driving
range
constraints
when
optimizing
distribution
mobility
plans.
During
last
years,
several
researchers
from
Computer
Science,
Artificial
Intelligence,
Operations
Research
communities
have
been
developing
optimization,
simulation,
machine
learning
approaches
that
aim
at
generating
efficient
sustainable
routing
plans
for
hybrid
fleets,
including
both
internal
combustion
engine
vehicles.
After
contextualizing
relevance
promoting
transportation
practices,
this
paper
reviews
existing
work
field
vehicle
problems.
In
particular,
we
focus
on
articles
related
well-known
routing,
arc
team
orienteering
review
is
followed
by
numerical
examples
illustrate
gains
can
be
obtained
employing
optimization
methods
aforementioned
field.
Finally,
research
opportunities
are
highlighted.
Applied Sciences,
Journal Year:
2022,
Volume and Issue:
12(9), P. 4607 - 4607
Published: May 3, 2022
In
this
paper,
we
adopt
the
bibliometric
analysis
software
CiteSpace
to
analyze
research
status
quo
and
evolution
trend
of
pickup
delivery
problem
(PDP),
an
important
real-world
issue
occurring
in
logistics
transportation.
We
obtain
819
documents
with
topic
PDP
that
were
published
Web
Science
core
collection
during
period
1995–2021,
acquire
their
basic
situation
posting
category
distribution.
Next,
employ
draw
scientific
knowledge
maps
perform
corresponding
visualization
analysis,
which
mainly
include
following
aspects:
(a)
collaboration
author,
country,
institution;
(b)
co-citation
journal,
reference;
(c)
citation
burst
detection
keyword;
(d)
clustering
reference.
The
results
show
has
gradually
become
interdisciplinary
highly
comprehensive,
hot
topics
also
reflects
directions
involve
multiple
academic
disciplines
professional
areas
ranging
from
algorithm
design
management.
changing
components
reveal
fact
development
is
related
diversity
uncertainty
realistic
industry
contexts.
Study
paper
provides
comprehensive
understandings
for
scholars
practitioners,
inspiring
its
further
investigation.
