Applied Sciences,
Год журнала:
2023,
Номер
13(24), С. 13086 - 13086
Опубликована: Дек. 7, 2023
As
a
new
delivery
mode,
the
collaborative
of
packages
using
trucks
and
drones
has
been
proven
to
reduce
costs
time.
To
cope
with
huge
cost
challenges
brought
by
strict
time
constraints
ever-changing
customer
orders
in
actual
process,
we
established
two-stage
optimization
model
based
on
different
demand
response
strategies
goal
minimizing
costs.
solve
this
problem,
designed
simulated
annealing
chimp
algorithm
sine–cosine
operator.
The
performance
is
improved
designing
variable-dimensional
matrix
encode
generate
an
initial
solution,
incorporating
operator
mechanism
avoid
falling
into
local
optimum.
Numerical
experiments
verify
effectiveness
proposed
strategy.
Finally,
analyze
impact
dynamic
degree
cost.
extend
theory
vehicle
routing
problem
also
provide
feasible
solution
for
route
planning,
taking
account
demands
windows.
Complex System Modeling and Simulation,
Год журнала:
2023,
Номер
3(1), С. 32 - 46
Опубликована: Март 1, 2023
At
present,
home
health
care
(HHC)
has
been
accepted
as
an
effective
method
for
handling
the
healthcare
problems
of
elderly.
The
HHC
scheduling
and
routing
problem
(HHCSRP)
attracts
wide
concentration
from
academia
industrial
communities.
This
work
proposes
HHCSRP
considering
several
centers,
where
a
group
customers
(i.e.,
patients
elderly)
require
being
assigned
to
centers.
Then,
various
kinds
services
are
provided
by
caregivers
in
different
regions.
By
skill
matching,
customers'
appointment
time,
caregivers'
workload
balancing,
this
article
formulates
optimization
model
with
multiple
objectives
achieve
minimal
service
cost
delay
cost.
To
handle
it,
we
then
introduce
brain
storm
particular
multi-objective
search
mechanisms
(MOBSO)
via
combining
features
investigated
HHCSRP.
Moreover,
perform
experiments
test
effectiveness
designed
method.
Via
comparing
MOBSO
two
excellent
optimizers,
results
confirm
that
developed
significant
superiority
addressing
considered
Applied Sciences,
Год журнала:
2021,
Номер
11(21), С. 10295 - 10295
Опубликована: Ноя. 2, 2021
Transportation
planning
has
been
established
as
a
key
topic
in
the
literature
and
social
production
practices.
An
increasing
number
of
researchers
are
studying
vehicle
routing
problems
(VRPs)
their
variants
considering
real-life
applications
scenarios.
Furthermore,
with
rapid
growth
processing
speed
memory
capacity
computers,
various
algorithms
can
be
used
to
solve
increasingly
complex
instances
VRPs.
In
this
study,
we
analyzed
recent
published
between
2019
August
2021
using
taxonomic
framework.
We
reviewed
research
according
models
solutions,
divided
into
three
categories
customer-related,
vehicle-related,
depot-related
models.
classified
solution
exact,
heuristic,
meta-heuristic
algorithms.
The
main
contribution
our
study
is
classification
table
that
available
online
Appendix
A.
This
should
enable
future
find
relevant
easily
provide
readers
trends
methodologies
field
VRPs
some
well-known
variants.
